Extremal connectivity for topological cliques in bipartite graphs

DOI10.1016/j.jctb.2005.06.005zbMath1080.05044OpenAlexW2017119382MaRDI QIDQ2581501

Deryk Osthus, Daniela Kühn

Publication date: 10 January 2006

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2005.06.005

zbMATH Keywords

subdivisionstopological minors

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40)

Related Items (3)

Local Conditions for Exponentially Many Subdivisions ⋮ A note on the saturation number of the family of \(k\)-connected graphs ⋮ Logarithmically small minors and topological minors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear connectivity forces large complete bipartite minors
• On graphs with small subgraphs of large chromatic number
• Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
• The extremal function for complete minors
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• Grad und lokaler Zusammenhang in endlichen Graphen
• Two Minor Problems
• Topological cliques in graphs II

This page was built for publication: Extremal connectivity for topological cliques in bipartite graphs