Triangle-free Hamiltonian Kneser graphs

Journal of Combinatorial Theory. Series B

Volumn 89, Issue 1, 2003, Pages 1-16

  Chen, Ya Chen ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

Antipodal layers problem; Hamiltonian cycles; Knesers graphs; Uniform subset graphs

Indexed keywords

EID: 0141761421     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0095-8956(03)00040-6     Document Type: Article

References (19)

1. Z.s. Baranyai, On the factorization of the complete uniform hypergraph, Colloq. Math. Soc. Janos Bolyai 10 (1975) 91-108.
2. B.-L. Chen, K.-W. Lih, Hamiltonian uniform subset graphs, J. Combin. Theory Ser. B 42 (1987) 257-263.
3. Y.-C. Chen, Kneser graphs are Hamiltonian for n ≥ 3k, J. Combin. Theory Ser. B 80 (1) (2000) 69-79.
4. W.E. Clark, M.E.H. Ismail, Binomial and Q-binomial coefficient inequalities related to the hamiltonicity of the Kneser graphs and their q-analogues, J. Combin. Theory Ser. A 76 (1996) 83-98.
5. I.J. Dejter, Hamilton cycles and quotients of bipartite graphs, Graph Theory with Applications to Algorithms and Computer Science, Wiley-Interscience, New York, 1985, pp. 189-199.
6. I. Hável, Semipaths in directed cubes, in: M. Fiedler (Ed.), Graphs and Other Combinatorial Topics, Teubner, Leipzig, 1982, pp. 101-108.
7. K. Heinrich, W.D. Wallis, Hamiltonian cycles in certain graphs, J. Austral. Math. Soc., Ser. A 26 (1978) 89-98.
8. G. Hurlbert, The antipodal layers problem, Discrete Math. 128 (1994) 237-245.
9. G. Katona, A theorem of finite sets, Theory of Graphs, Proc. Colloq., Tihany, 1966, Academic Press, New York, 1968, pp. 187-207.
10. D. Kelly, Problem 2.5, in: I. Rival (Ed.), Graphs and Order: the Role of Graphs in the Theory of Ordered Sets and its Applications, Reidel, Dordrecht, 1985.
11. J.B. Kruskal, The number of simplices in a complex, Mathematical Optimization Techniques, University of California Press, Berkeley, CA, 1963, pp. 251-278.
12. 7, Combinatorics, Proc. Conf. Combinatorial, Math., Math. Inst., Oxford, 1972, pp. 229-236.
13. E.K. Lloyd, G.H.J. Meredith, The footballers of Croam, J. Combin. Theory Ser. B 15 (1973) 161-166.
14. M. Mather, The rugby footballers of croam, J. Combin. Theory Ser. B 20 (1976) 62.
15. D.K. Ray-Chaudhuri, R.M. Wilson, On t-designs, Osaka J. Math. 12 (1975) 737-744.
16. C.D. Savage, I. Shields, A new Hamilton path heuristic with applications to the middle two levels problem, Congr. Numer. 140 (1999) 161-178.
17. C.D. Savage, I. Shields, A Note on Hamilton Cycles in Kneser Graphs, Bulletin of the ICA, to appear.
18. C.D. Savage, P. Winkler, Monotone gray codes and the middle levels problem, J. Combin. Theory Ser. A 70 (1995) 230-248.
19. J.E. Simpson, On uniform subset graphs, Ars Combin. 37 (1994) 309-318.