There exists an absolute constant g0 such that every graph G with δ(G) ≥ k and g(G) ≥ g0 contains an induced subdivision of K_{k+1} for k ≥ 3.
Catlin, Haj´ os’ graph-coloring conjecture: variations and counterexamples,J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Induced subdivisions in graphs of large girth
There exists an absolute constant g0 such that every graph G with δ(G) ≥ k and g(G) ≥ g0 contains an induced subdivision of K_{k+1} for k ≥ 3.