g(k,m) ≤ max(m+2k-2, 3k+1) for k ≥ 1, m ≥ 2, proving Thomassen's conjecture g(k, k+1) ≤ 3k+1 via a new Hall-feasibility argument.
Isolating highly connected induced subgraphs
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
-
Proof of Thomassen's Conjecture on Highly connected subgraphs with large chromatic number
g(k,m) ≤ max(m+2k-2, 3k+1) for k ≥ 1, m ≥ 2, proving Thomassen's conjecture g(k, k+1) ≤ 3k+1 via a new Hall-feasibility argument.