On the Alspach Conjecture

Combinatorics Probability and Computing

Volumn 10, Issue 2, 2001, Pages 95-125

  Balister, P N ^a  

^a University of Memphis   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035607189     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548301004539     Document Type: Article

References (16)

1. Adams, P., Bryant, D. E. and Khodkar, A. (1998) (3,5)-cycle decompositions. J. Combin. Designs 6 91-110.
2. Alspach, B. (1981) Research problem 3. Discrete Math. 36 333-334.
3. n - I. Submitted to J. Combin. Theory Ser. B.
4. Alspach, B. and Marshall, S. (1994) Even cycle decompositions of complete graphs minus a 1-factor. J. Combin. Designs 2 441-458.
5. n. Combin. Probab. Comput., to appear.
6. Bryant, D. E., Khodkar, A. and Fu, H. L. (m, n)-cycle systems. J. Statist. Planning and Inference, to appear.
7. Caro, Y. and Yuster, R. (2000) List decomposition of graphs. Preprint.
8. Gustavsson, T. (1991) Decompositions of large graphs and digraphs with high minimum degree. Doctoral Dissertation, Dept. of Mathematics, Univ. of Stockholm.
9. Häggkvist, R. (1985) A lemma on cycle decomposition. Ann. Discrete Math. 27 227-232.
10. Heinrich, K., Horak, P. and Rosa, A. (1989) On Alspach's conjecture. Discrete Math. 77 97-121.
11. O'Keefe, E. S. (1961) Verification of conjecture of Th. Skolem. Math. Scand. 2 80-82.
12. Rosa, A. Alspach's conjecture is true for n ≤ 10. Mathematical reports, McMaster University.
13. Skolem, T. (1957) On certain distributions of integers in pairs with given differences. Math. Scand. 5 57-58.
14. Stanton, R. G. and Goulden, I. P. (1981) Graph factorization, general triple systems, and cyclic triple systems. Aequationes Math. 22 1-28.
15. Sun, H. C. (1985) On the cycle decomposition of complete graphs. Nanjing Daxue Xuebao Ziran Kexue Ban 21 421-426. In Chinese.
16. Wilson, R. M. (1975) Decomposition of complete graphs into subgraphs isomorphic to a given graph. In Proc. 5th British Combinatorial Conference, pp. 647-659