4 research outputs found
A proof of Mader's conjecture on large clique subdivisions in -free graphs
Given any integers , we show there exists some such
that any -free graph with average degree contains a subdivision of
a clique with at least vertices. In particular,
when this resolves in a strong sense the conjecture of Mader in 1999 that
every -free graph has a subdivision of a clique with order linear in the
average degree of the original graph. In general, the widely conjectured
asymptotic behaviour of the extremal density of -free graphs suggests
our result is tight up to the constant .Comment: 25 pages, 1 figur
Subdivisions in a bipartite graph
Given a bipartite graph G with m and n vertices, respectively,in its vertices classes, and given two integers s, t such that 2 ≤ s ≤ t, 0 ≤ m−s ≤ n−t, and m+n ≤ 2s+t−1, we prove that if G has at least mn−(2(m−s)+n−t) edges then it contains a subdivision of the complete bipartite with s vertices in the m-class and t vertices in the n-class. Furthermore, we characterize the corresponding extremal bipartite graphs with mn − (2(m − s) + n − t + 1) edges for this topological Turan type problem.Peer Reviewe