On the intersection problem for 1-factorizations and near 1-factorizations of K-v

Bryant, DE and Khodkar, A (2001) On the intersection problem for 1-factorizations and near 1-factorizations of K-v. Utilitas Mathematica, 60 209-218.

Author Bryant, DE
Khodkar, A
Title On the intersection problem for 1-factorizations and near 1-factorizations of K-v
Journal name Utilitas Mathematica   Check publisher's open access policy
ISSN 0315-3681
Publication date 2001-01-01
Sub-type Article (original research)
Volume 60
Start page 209
End page 218
Total pages 10
Editor R.G. Stanton
Place of publication Canada
Publisher Utilitas Mathematica Publishing Inc
Language eng
Subject C1
230101 Mathematical Logic, Set Theory, Lattices And Combinatorics
780101 Mathematical sciences
Abstract The number of 1-factors (near 1-factors) that mu 1-factorizations (near 1-factorizations) of the complete graph K-v, v even (v odd), can have in common, is studied. The problem is completely settled for mu = 2 and mu = 3.
Keyword Mathematics, Applied
Statistics & Probability
Q-Index Code C1

Document type: Journal Article
Sub-type: Article (original research)
Collection: School of Physical Sciences Publications
 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in Thomson Reuters Web of Science Article
Google Scholar Search Google Scholar
Created: Wed, 15 Aug 2007, 01:04:43 EST