Induced subdivisions in graphs of large girth

Abstract

In this paper, we prove that there exists an absolute constant g0 such that, for every integer k 3, every graph G with δ(G) k and g(G) g0 contains an induced subdivision of Kk+1. This fully resolves a problem raised by Kühn and Osthus (originally attributed to Shi), and improves a recent result of Girão and Hunter. Our proof uses some ideas from Girão and Hunter. Another main ingredient in our proof is an induced variant of Mader's theorem: for every fixed \(s,η,D\), every graph \(J\) with \(Δ(J) D\), \(d(J)>s-2+η\) and sufficiently large girth contains an induced subdivision of \(Ks\).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…