Clique minors in graphs with a forbidden subgraph
From MaRDI portal
Publication:6074687
DOI10.1002/rsa.21038zbMath1522.05458arXiv2002.11100OpenAlexW3194846620MaRDI QIDQ6074687
Matija Bucić, Benjamin Sudakov, Jacob Fox
Publication date: 12 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.11100
Cites Work
- Unnamed Item
- Unnamed Item
- Complete minors in \(K_{s,s}\)-free graphs
- Large minors in graphs with given independence number
- Graph minors. XX: Wagner's conjecture
- A basic elementary extension of the Duchet-Meyniel theorem
- The early evolution of the \(H\)-free process
- Minors in expanding graphs
- On a relationship between Hadwiger and stability numbers
- Hadwiger's conjecture is true for almost every graph
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Homomorphiesätze für Graphen
- Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture
- Über eine Eigenschaft der ebenen Komplexe
- Hadwiger’s Conjecture
- Complete minors, independent sets, and chordal graphs
- Complete Minors and Independence Number
- New tools and results in graph minor structure theory
- An extremal function for contractions of graphs
- Graph minor theory
- On Hadwiger's Number and the Stability Number
- Subcontraction-equivalence and Hadwiger's conjecture
- Every planar map is four colorable
- On a special case of Hadwiger's conjecture
- Independence number and clique minors
- On a problem of K. Zarankiewicz
This page was built for publication: Clique minors in graphs with a forbidden subgraph
