ProbXiv
Explorersign in
Problem archiveProblem record

Statement

All graphs under consideration are finite and simple. For a graph GG and a vertex vv, let dG(v)d_G(v) denote the degree of vv. Dean's conjecture. For every integer k≥3k \ge 3, every graph with minimum degree at least kk contains a cycle of length divisible by kk. The conjecture is known to be true for all k≠5k\neq 5, so the case k=5k=5 remains 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.