Extremal connectivity for topological cliques in bipartite graphs (Q2581501): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.jctb.2005.06.005 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2017119382 / rank | |||
Normal rank |
Revision as of 22:01, 19 March 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