论文信息 - Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs

Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs

We prove that, for large n, every 3-connected D-regular graph on n vertices with D ź n / 4 is Hamiltonian. This is best possible and verifies the only remaining case of a conjecture posed independently by Bollobas and Haggkvist in the 1970s. The proof builds on a structural decomposition result proved recently by the same authors.

[1] Daniela Kühn,et al. Hamiltonian degree sequences in digraphs , 2008, J. Comb. Theory, Ser. B.

[2] H. A. Jung. LONGEST CIRCUITS IN 3-CONNECTED GRAPHS , 1984 .

[3] Béla Bollobás,et al. Hamiltonian Cycles in Regular Graphs , 1978 .

[4] Bill Jackson,et al. Dominating cycles in regular 3-connected graphs , 1992, Discret. Math..

[5] Paul Erdös,et al. A class of Hamiltonian regular graphs , 1978, J. Graph Theory.

[6] Daniela Kühn,et al. A survey on Hamilton cycles in directed graphs , 2010, Eur. J. Comb..

[7] Katherine Staden. Robust expansion and Hamiltonicity , 2015 .

[8] Genghua Fan,et al. Longest cycles in regular graphs , 1985, J. Comb. Theory, Ser. B.

[9] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

[10] Deryk Osthus,et al. The robust component structure of dense regular graphs and applications , 2014, 1401.0424.

[11] Bill Jackson,et al. Hamiltonicity of regular 2-connected graphs , 1996, J. Graph Theory.

[12] C. Nash-Williams,et al. Hamiltonian arcs and circuits , 1971 .

[13] Bill Jackson. Hamilton cycles in regular 2-connected graphs , 1980, J. Comb. Theory, Ser. B.

[14] Bill Jackson,et al. Hamiltonicity of regular 2-connected graphs , 1996 .

[15] Hao Li,et al. Hamilton cycles in regular 3-connected graphs , 1992, Discret. Math..

[16] B. Bollobás,et al. Extremal Graph Theory , 2013 .