Long cycles in the middle two layers of the discrete cube

Journal of Combinatorial Theory. Series A

Volumn 105, Issue 2, 2004, Pages 255-271

  Johnson, J Robert ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Cycle; Discrete cube; Hamilton cycle; Kneser graph; Middle two layers problem; Odd graph

Indexed keywords

EID: 1942510305     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcta.2003.11.004     Document Type: Article

References (7)

1. N. Biggs, Some odd graph theory, Ann. New York Acad. Sci. 319 (1979) 71-81.
2. B. Bollobás, Combinatorics, Cambridge University Press, Cambridge, 1986.
3. S. Felsner, W.T. Trotter, Colorings of diagrams of interval orders and α-sequences of sets, Discrete Math. 144 (1995) 23-31.
4. I. Havel, Semipaths in directed cubes, in: M. Fiedler (Ed.), Graphs and other Combinatorial Topics, Teubner-Texte Math., Teubner, Leipzig, 1983, pp. 101-108.
5. J.R. Johnson, Baranyai partitions and Kneser graphs, Ph.D. Thesis, University of Cambridge, 2003.
6. C.D. Savage, I. Shields, A Hamilton path heuristic with applications to the middle two levels problem, Congr. Numer. 140 (1999) 161-178.
7. C.D. Savage, P. Winkler, Monotone Gray codes and the middle levels problem, J. Combin. Theory. Ser. A 70 (1995) 230-248.