ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers nn and cc, let f(n,c)f(n,c) be the least integer dd such that every nn-vertex graph with minimum degree at least dd contains a cycle with at least cc chords. Kára and Král's conjecture.

f(31,31)=8.f(31,31)=8.

Their known bounds are 8≤f(31,31)≤98\leq f(31,31)\leq9, so the conjecture asks whether the lower bound is sharp. The supplied text gives no resolution evidence.

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.