Small complete minors above the extremal edge density
From MaRDI portal
Publication:313429
DOI10.1007/s00493-015-3013-2zbMath1363.05241arXiv1208.3568OpenAlexW1970872869MaRDI QIDQ313429
Asaf Shapira, Benjamin Sudakov
Publication date: 9 September 2016
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.3568
Related Items (13)
Tree densities in sparse graph classes ⋮ Hypergraphs with no tight cycles ⋮ Small complete minors above the extremal edge density ⋮ Short proofs of some extremal results. II. ⋮ Rolling backwards can move you forward: On embedding problems in sparse expanders ⋮ Polynomial expansion and sublinear separators ⋮ Finding large expanders in graphs: from topological minors to induced subgraphs ⋮ Towards the Erdős-Gallai cycle decomposition conjecture ⋮ Finding and Using Expanders in Locally Sparse Graphs ⋮ Rainbow Turán number of clique subdivisions ⋮ A Tight Erdös--Pósa Function for Wheel Minors ⋮ A note on sublinear separators and expansion ⋮ Logarithmically small minors and topological minors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Small complete minors above the extremal edge density
- Small minors in dense graphs
- Lower bound of the Hadwiger number of graphs by their average degree
- Minors in expanding graphs
- Small topological complete subgraphs of ``dense graphs
- Ramanujan graphs
- The extremal function for complete minors
- Graph minors. XIII: The disjoint paths problem
- A sublinear bipartiteness tester for bounded degree graphs
- Homomorphiesätze für Graphen
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Highly linked graphs
- An extremal function for contractions of graphs
- Expander graphs and their applications
- A Separator Theorem for Nonplanar Graphs
This page was built for publication: Small complete minors above the extremal edge density