Cycles of many lengths in Hamiltonian graphs
From MaRDI portal
Publication:5102252
DOI10.1017/fms.2022.42zbMath1496.05039arXiv2104.07633OpenAlexW4293776189WikidataQ114118403 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
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (1)
Cites Work
- Unnamed Item
- Cycle spectra of Hamiltonian graphs
- Girth in graphs
- New sufficient conditions for cycles in graphs
- Hamiltonian degree conditions which imply a graph is pancyclic
- Cycle lengths in sparse graphs
- Pancyclicity of Hamiltonian and highly connected graphs
- A cycle structure theorem for Hamiltonian graphs
- Spanning cycles of nearly cubic graphs
- The number of cycle lengths in graphs of given minimum degree and girth
- Independent dominating sets and a second hamiltonian cycle in regular graphs
- Long cycles in Hamiltonian graphs
- A note on cycle lengths in graphs
- \(C_4\)-free subgraphs with large average degree
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
- Pancyclic graphs. I
- On Hamilton's ideals
- A note on Hamiltonian circuits
- Complete sequences of polynomial values
- Extremal problems for cycles in graphs
- Note on Hamilton Circuits
- A Unified Proof of Conjectures on Cycle Lengths in Graphs
- Some Theorems on Abstract Graphs
- On Hamiltonian Circuits
This page was built for publication: Cycles of many lengths in Hamiltonian graphs
