Extremal connectivity for topological cliques in bipartite graphs (Q2581501)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2244755
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extremal connectivity for topological cliques in bipartite graphs |
scientific article; zbMATH DE number 2244755 |
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
0.8063276410102844
0 references
0.7796255350112915
0 references
0.7756720185279846
0 references
0.768912672996521
0 references
0.7617748975753784
0 references
