ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG, write δ(G)\delta(G) for its minimum degree and girth⁡(G)\operatorname{girth}(G) for its girth. A graph is induced-subgraph-free of the two basic obstructions when it contains neither the relevant clique nor biclique as an induced subgraph. The induced Thomassen conjecture. There is a function g:N2→Ng:\mathbb{N}^2\rightarrow\mathbb{N} such that for any integers kk and dd, every graph GG with δ(G)≥g(k,d)\delta(G)\geq g(k,d) has an induced subgraph HH for which either H≅KdH\cong K_d, H≅Kd,dH\cong K_{d,d}, or

δ(H)>dandgirth⁡(H)>k.\delta(H)>d\quad\text{and}\quad \operatorname{girth}(H)>k.

The claim seeks an induced-subgraph analogue of Thomassen's conjecture. The clique and biclique alternatives are necessary because KtK_t and Kt,tK_{t,t} have no induced subgraph of minimum degree greater than 11 and girth greater than 44.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.