Extremal connectivity for topological cliques in bipartite graphs (Q2581501): Difference between revisions

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.