Pancyclicity of highly connected graphs
Journal of the European Mathematical Society · 28.07.2026
DOI: 10.4171/jems/1808 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of the European Mathematical Society, erschienen am 28.07.2026. Verfasst von Shoham Letzter.
Abstract (Originalsprache)
A well-known result due to Chvátal and Erdős (1972) asserts that, if a graph G satisfies \kappa(G) \ge \alpha(G) , where \kappa(G) is the vertex-connectivity of G , then G has a Hamilton cycle. We prove a similar result implying that a graph G is pancyclic , that is, it contains cycles of all lengths between 3 and |G| : if |G| is large and \kappa(G) > \alpha(G) , then G is pancyclic. This confirms a conjecture of Jackson and Ordaz (1990) for large graphs, and improves upon a very recent result of Draganić, Munhá Correia, and Sudakov.
Zitieren
APA
Letzter, S. (2026). Pancyclicity of highly connected graphs. Journal of the European Mathematical Society. https://doi.org/10.4171/jems/1808
Vancouver
Letzter S. Pancyclicity of highly connected graphs. Journal of the European Mathematical Society. 2026. doi:10.4171/jems/1808
BibTeX
@article{Letzter2026,
author = {Letzter, Shoham},
title = {Pancyclicity of highly connected graphs},
journal = {Journal of the European Mathematical Society},
year = {2026},
doi = {10.4171/jems/1808}
}
EUVIMED