A proof of Mader's conjecture on large clique subdivisions in C4-free graphs

DOI10.1112/jlms.12019zbMath1370.05103arXiv1605.07791OpenAlexW3125259119WikidataQ123219507 ScholiaQ123219507MaRDI QIDQ5357340

Richard Montgomery, Hong Liu

Publication date: 15 September 2017

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

Maders conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph minors (05C83)

Related Items (12)

Well-mixing vertices and almost expanders ⋮ Crux and Long Cycles in Graphs ⋮ Clique immersion in graphs without a fixed bipartite graph ⋮ Disjoint isomorphic balanced clique subdivisions ⋮ Proof of Komlós's conjecture on Hamiltonian subsets ⋮ Rainbow clique subdivisions ⋮ Balanced Subdivisions of a Large Clique in Graphs with High Average Degree ⋮ A solution to Erdős and Hajnal’s odd cycle problem ⋮ How to build a pillar: a proof of Thomassen's conjecture ⋮ Towards the Erdős-Gallai cycle decomposition conjecture ⋮ Nested cycles with no geometric crossings ⋮ Ramsey numbers of cycles versus general graphs

This page was built for publication: A proof of Mader's conjecture on large clique subdivisions in C4-free graphs