Liu–Ma conjecture on consecutive odd cycles
Statement
Let ) be a -connected non-bipartite graph with minimum degree at least .
Liu–Ma conjecture. contains cycles with consecutive odd lengths.
Liu and Ma proposed this conjecture after proving the lower bound ; the conjecture is sharp for the complete graph . This paper's abstract states that the conjecture is confirmed for every , so the conjecture is solved.
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.