Complete minors in K_s,s-free graphs

DOI10.1007/S00493-005-0004-8MaRDI QIDQ558314zbMATH OpenOpenAlexFDO

Authors Daniela Kühn, Deryk Osthus

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

zbMATH Keywords

complete minors

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph minors (05C83) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Recommendations

• Clique minors in graphs with a forbidden subgraph
• Minors in graphs of large girth
• Forcing unbalanced complete bipartite minors
• On \(K_{s,t}\)-minors in graphs with given average degree
• \(K_{s,t}\) minors in \((s+t)\)-chromatic graphs. II

Cited in

(18)

• Clique immersion in graphs without a fixed bipartite graph
• Minors in graphs of large _r-girth
• Graph theory. Abstracts from the workshop held January 2--8, 2022
• Breaking the degeneracy barrier for coloring graphs with no K_t minor
• On \(K_{s,t}\) minors in \((s+t)\)-chromatic graphs
• On triangles in \(K_r\)-minor free graphs
• Complete Minors in Graphs Without Sparse Cuts
• \(K_{s,t}\) minors in \((s+t)\)-chromatic graphs. II
• Clique minors in graphs with a forbidden subgraph
• Complete minors in complements of nonseparating planar graphs
• Recent progress towards Hadwiger's conjecture
• Minors in small-set expanders
• Limits of degeneracy for colouring graphs with forbidden minors
• Independence number in triangle-free graphs avoiding a clique minor
• Reducing linear Hadwiger's conjecture to coloring small graphs
• Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
• Dense graphs have \(K_{3,t}\) minors
• Some recent progress and applications in graph minor theory

This page was built for publication: Complete minors in \(K_{s,s}\)-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q558314)