How to build a pillar: a proof of Thomassen's conjecture

DOI10.1016/j.jctb.2023.04.004zbMath1519.05143arXiv2201.07777MaRDI QIDQ6170787

Irene Gil Fernández, Hong Liu

Publication date: 10 August 2023

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

pathscyclesaverage degreeexpander graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial probability (60C05) Expander graphs (05C48)

Related Items (1)

Towards the Erdős-Gallai cycle decomposition conjecture

Cites Work

• Unnamed Item
• Proof of Komlós's conjecture on Hamiltonian subsets
• Cycles of even length in graphs
• Dense graphs without 3-regular subgraphs
• Graph minors. XIII: The disjoint paths problem
• Vertex-disjoint cycles of the same length
• Expansion in supercritical random subgraphs of the hypercube and its consequences
• Clique immersion in graphs without a fixed bipartite graph
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Highly linked graphs
• On Arithmetic Progressions of Cycle Lengths in Graphs
• A note on the Turán function of even cycles
• The phase transition in random graphs: A simple proof
• Cycles Modulo k
• Topological cliques in graphs II
• Nested cycles with no geometric crossings
• Extremal density for sparse minors and subdivisions
• Crux and Long Cycles in Graphs
• A Unified Proof of Conjectures on Cycle Lengths in Graphs
• Expanders – how to find them, and what to find in them
• A proof of Mader's conjecture on large clique subdivisions in C4-free graphs
• On the maximal number of independent circuits in a graph
• Ramsey numbers of cycles versus general graphs
• A solution to Erdős and Hajnal’s odd cycle problem

This page was built for publication: How to build a pillar: a proof of Thomassen's conjecture