Extremal connectivity for topological cliques in bipartite graphs (Q2581501): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q256988 |
||
| Property / author | |||
| Property / author: Daniela Kühn / rank | |||
Revision as of 02:50, 12 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extremal connectivity for topological cliques in bipartite graphs |
scientific article |
Statements
Extremal connectivity for topological cliques in bipartite graphs (English)
0 references
10 January 2006
0 references
Given a natural number \(s\), let \(d(s)\) be the smallest number such that every graph of average degree greater than \(d(s)\) contains a subdivision of the complete graph of order \(s\). The authors establish a lower bound of \(d(s)\) for bipartite graphs whose connectivity is close to their average degree.
0 references
topological minors
0 references
subdivisions
0 references
