Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density
From MaRDI portal
Publication:1011746
DOI10.1016/j.disc.2008.01.010zbMath1170.05040MaRDI QIDQ1011746
Alexandr V. Kostochka, Thomas Böhme
Publication date: 9 April 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.01.010
05C40: Connectivity
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Lower bound of the Hadwiger number of graphs by their average degree
- Linear connectivity forces large complete bipartite minors
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- The extremal function for complete minors
- Homomorphiesätze für Graphen
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
- An extremal function for contractions of graphs
- Topological cliques in graphs II