ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG) be a 2-connected graph on nn vertices, and let c(G)c(G) denote the length of a longest cycle in GG. Woodall's conjecture. If there are at least n2+k\frac{n}{2}+k vertices of degree at least kk, then

c(G)≥2k.c(G)\geq 2k.

This conjecture is proved in the paper as an application of the strengthened Erdős–Gallai theorem.

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.