Cycles of many lengths in Hamiltonian graphs

DOI10.1017/fms.2022.42zbMath1496.05039arXiv2104.07633WikidataQ114118403 ScholiaQ114118403MaRDI QIDQ5102252

Lior Gishboliner, Matija Bucić, Benjamin Sudakov

Publication date: 6 September 2022

Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.07633

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C38: Paths and cycles

05C12: Distance in graphs

05C45: Eulerian and Hamiltonian graphs

05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)