Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density
type: Item
instance of: scholarly article
title: Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density
zbMATH Open document ID: 1170.05040
author: T. Böhme
author: Alexandr Kostochka
published in: Discrete Mathematics
publication date: 2009-04-09T00:00:00Z
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5542399
zbMATH Keywords: graph minors
zbMATH Keywords: edge density
zbMATH Keywords: connected subgraphs
MaRDI profile type: Publication
full work available at URL: j.disc.2008.01.010
OpenAlex ID: W2126027527
cites work: Linear connectivity forces large complete bipartite minors
cites work: Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
cites work: Q4715442
cites work: Topological cliques in graphs II
cites work: Q3333070
cites work: Lower bound of the Hadwiger number of graphs by their average degree
cites work: Homomorphieeigenschaften und mittlere Kantendichte von Graphen
cites work: Homomorphiesätze für Graphen
cites work: Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
cites work: An extremal function for contractions of graphs
cites work: The extremal function for complete minors
DOI: 10.1016/J.DISC.2008.01.010
description: scientific article; zbMATH DE number 5542399