Forcing a sparse minor
From MaRDI portal
Publication:5366891
DOI10.1017/S0963548315000073zbMath1372.05211arXiv1402.0272OpenAlexW3098569837MaRDI QIDQ5366891
Publication date: 10 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.0272
Extremal problems in graph theory (05C35) Graph minors (05C83) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items
Cycles of Given Size in a Dense Graph, Complete directed minors and chromatic number, A lower bound on the average degree forcing a minor, On the extremal function for graph minors, Phase transition of degeneracy in minor-closed families, Tight bounds for divisible subdivisions, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Minor-Closed Graph Classes with Bounded Layered Pathwidth, On the purity of minor-closed classes of graphs, The extremal function for Petersen minors, Hadwiger’s Conjecture, Extremal functions for sparse minors, Average degree conditions forcing a minor
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The edge-density for \(K_{2,t}\) minors
- Forcing unbalanced complete bipartite minors
- Dense graphs have \(K_{3,t}\) minors
- Lower bound of the Hadwiger number of graphs by their average degree
- Disjoint unions of complete minors
- On \(K_{s,t}\)-minors in graphs with given average degree
- Density theorems for bipartite graphs and related Ramsey-type results
- On the maximum density of graphs which have no subcontraction to \(K^ r\).
- Hadwiger's conjecture is true for almost every graph
- The extremal function for unbalanced bipartite minors
- On \(K_{s,t}\)-minors in graphs with given average degree. II
- An improved linear edge bound for graph linkages
- The extremal function for complete minors
- The extremal function for noncomplete minors
- Disjoint complete minors and bipartite minors
- The extremal function for \(K_{9}\) minors
- Homomorphiesätze für Graphen
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Weighted sums of certain dependent random variables
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
- Homomorphism theorems for graphs
- An extremal function for contractions of graphs
- Contractions to k8
- A Note on Vertex-Disjoint Cycles
- On the maximal number of independent circuits in a graph