Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density (Q1011746): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.01.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2126027527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear connectivity forces large complete bipartite minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4715442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological cliques in graphs II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3333070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound of the Hadwiger number of graphs by their average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphieeigenschaften und mittlere Kantendichte von Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphiesätze für Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal function for contractions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for complete minors / rank
 
Normal rank

Latest revision as of 12:00, 1 July 2024

scientific article
Language Label Description Also known as
English
Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density
scientific article

    Statements