On \(K_{s,t}\)-minors in graphs with given average degree
From MaRDI portal
Publication:941384
DOI10.1016/j.disc.2007.08.041zbMath1171.05047OpenAlexW2161786935MaRDI QIDQ941384
Noah Prince, Alexandr V. Kostochka
Publication date: 4 September 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.041
Related Items
Rooted minor problems in highly connected graphs ⋮ Disjoint complete minors and bipartite minors ⋮ Cycles of Given Size in a Dense Graph ⋮ Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs ⋮ The extremal function for disconnected minors ⋮ The edge-density for \(K_{2,t}\) minors ⋮ A lower bound on the average degree forcing a minor ⋮ Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth ⋮ Recent progress towards Hadwiger's conjecture ⋮ Small minors in dense graphs ⋮ Forcing a sparse minor ⋮ Asymptotic density of graphs excluding disconnected minors ⋮ Disjoint unions of complete minors ⋮ The extremal function for Petersen minors ⋮ The Colin de Verdière parameter, excluded minors, and the spectral radius ⋮ On \(K_{s,t}\)-minors in graphs with given average degree. II ⋮ Minors in ‐ Chromatic Graphs, II ⋮ Forcing unbalanced complete bipartite minors ⋮ Dense graphs have \(K_{3,t}\) minors ⋮ Linear connectivity forces large complete bipartite minors ⋮ List-coloring graphs without \(K_{4,k}\)-minors ⋮ Extremal functions for sparse minors ⋮ Average degree conditions forcing a minor
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Forcing unbalanced complete bipartite minors
- Lower bound of the Hadwiger number of graphs by their average degree
- The extremal function for unbalanced bipartite minors
- The extremal function for complete minors
- The extremal function for noncomplete minors
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- An extremal function for contractions of graphs
