Dean's conjecture on cycles divisible by the minimum-degree bound
Statement
All graphs under consideration are finite and simple. For a graph and a vertex , let denote the degree of . Dean's conjecture. For every integer , every graph with minimum degree at least contains a cycle of length divisible by . The conjecture is known to be true for all , so the case 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.