On the intersection problem for 1-factorizations and near 1-factorizations of K-v
| Contribuinte(s) |
R.G. Stanton |
|---|---|
| Data(s) |
01/01/2001
|
| Resumo |
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. |
| Identificador | |
| Idioma(s) |
eng |
| Publicador |
Utilitas Mathematica Publishing Inc |
| Palavras-Chave | #Mathematics, Applied #Statistics & Probability #C1 #230101 Mathematical Logic, Set Theory, Lattices And Combinatorics #780101 Mathematical sciences |
| Tipo |
Journal Article |
