Extremal connectivity for topological cliques in bipartite graphs
From MaRDI portal
Publication:2581501
DOI10.1016/J.JCTB.2005.06.005zbMATH Open1080.05044OpenAlexW2017119382MaRDI QIDQ2581501FDOQ2581501
Authors: 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
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The extremal function for complete minors
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Random graphs.
- Title not available (Why is that?)
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- Topological cliques in graphs II
- Title not available (Why is that?)
- Two Minor Problems
- Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
- On graphs with small subgraphs of large chromatic number
- Linear connectivity forces large complete bipartite minors
- Title not available (Why is that?)
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
- Grad und lokaler Zusammenhang in endlichen Graphen
Cited In (5)
This page was built for publication: Extremal connectivity for topological cliques in bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581501)