Induced subdivisions of Kd+1 in graphs of high girth
Abstract
In this paper, we show that for all k≥ 108, every graph with minimum degree k and girth at least 108 contains an induced subdivision of a Kk+1. This answers a problem asked by K\"uhn and Osthus (originally attributed to Shi).
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.