Complete minors in \(K_{s,s}\)-free graphs
From MaRDI portal
Publication:558314
DOI10.1007/s00493-005-0004-8zbMath1063.05123OpenAlexW2025859007MaRDI QIDQ558314
Publication date: 5 July 2005
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-005-0004-8
Extremal problems in graph theory (05C35) Graph minors (05C83) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items
Complete Minors in Graphs Without Sparse Cuts ⋮ Minors in graphs of large \(\theta_r\)-girth ⋮ Clique immersion in graphs without a fixed bipartite graph ⋮ Some recent progress and applications in graph minor theory ⋮ Clique minors in graphs with a forbidden subgraph ⋮ Recent progress towards Hadwiger's conjecture ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor
