ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For an integer kk, a graph has girth at least kk if its shortest cycle has length at least kk. A graph has sufficiently large minimum degree when its minimum degree exceeds a threshold depending on kk.

Thomassen's conjecture. For every integer kk, every graph of sufficiently large minimum degree contains a bipartite subgraph of girth at least kk and large minimum degree.

The paper uses a weaker known result with girth at least 66 and cites Thomassen's statement as a conjecture. No resolution is supplied in the text, so its status is left open.

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.