The extremal function for noncomplete minors
From MaRDI portal
Publication:2368599
DOI10.1007/S00493-005-0044-0zbMATH Open1092.05064OpenAlexW2120650079MaRDI QIDQ2368599FDOQ2368599
Authors: Josef Samuel Myers, Andrew Thomason 
Publication date: 27 June 2006
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-005-0044-0
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Graph minors (05C83)
Cited In (40)
- The extremal function for disconnected minors
- Average degree conditions forcing a minor
- Forcing a sparse minor
- Extremal density for sparse minors and subdivisions
- The poset of hypergraph quasirandomness
- Forcing unbalanced complete bipartite minors
- Dense graphs have \(K_{3,t}\) minors
- The number of graphs not containing \(K_{3,3}\) as a minor
- On \(K_{s,t}\)-minors in graphs with given average degree
- Linear connectivity forces large complete bipartite minors
- Title not available (Why is that?)
- The extremal function for unbalanced bipartite minors
- The extremal function for \(K_{8}^{-}\) minors
- Graphs without minor complete subgraphs
- Extremal functions for sparse minors
- On the extremal function for graph minors
- Rooted minor problems in highly connected graphs
- Extremal functions for graph minors
- On \(K_{s,t}\)-minors in graphs with given average degree. II
- The extremal function for complete minors
- Title not available (Why is that?)
- Minor extremal problems using Turan graphs
- Small minors in dense graphs
- Some recent progress and applications in graph minor theory
- The extremal function for Petersen minors
- Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
- The extremal function for \(K_9^=\) minors
- Subdivisions, linking, minors, and extremal functions
- List-coloring graphs without \(K_{4,k}\)-minors
- Recent progress towards Hadwiger's conjecture
- The extremal function for \(K_{9}\) minors
- Hadwiger's conjecture
- An extremal function for contractions of graphs
- A lower bound on the average degree forcing a minor
- Cycles of Given Size in a Dense Graph
- Asymptotic density of graphs excluding disconnected minors
- Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm
- Disjoint complete minors and bipartite minors
- Disjoint unions of complete minors
- On the purity of minor-closed classes of graphs
This page was built for publication: The extremal function for noncomplete minors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368599)
