A solution to Erdős and Hajnal’s odd cycle problem
From MaRDI portal
Publication:6165143
DOI10.1090/jams/1018zbMath1519.05136arXiv2010.15802OpenAlexW4297494759MaRDI QIDQ6165143
No author found.
Publication date: 31 July 2023
Published in: Journal of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.15802
Related Items (8)
Crux and Long Cycles in Graphs ⋮ Disjoint isomorphic balanced clique subdivisions ⋮ Divisible subdivisions ⋮ Rainbow clique subdivisions ⋮ Balanced Subdivisions of a Large Clique in Graphs with High Average Degree ⋮ How to build a pillar: a proof of Thomassen's conjecture ⋮ Towards the Erdős-Gallai cycle decomposition conjecture ⋮ Tight bounds for divisible subdivisions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cycles in graphs with large independence ratio
- Cycle lengths in sparse graphs
- Graphs with \(k\) odd cycle lengths
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- Some old and new problems in various branches of combinatorics
- Proof of Komlós's conjecture on Hamiltonian subsets
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Extremal problems for cycles in graphs
- Unavoidable cycle lengths in graphs
- Subdivisions of graphs with large minimum degree
- On the distribution of cycle lengths in graphs
- Cycles Modulo k
- Topological Cliques in Graphs
- Topological cliques in graphs II
- A proof of Mader's conjecture on large clique subdivisions in C4-free graphs
- On chromatic number of graphs and set-systems
- Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind
This page was built for publication: A solution to Erdős and Hajnal’s odd cycle problem
