Gould, Horn and Magnant's chorded-cycle packing conjecture
Statement
Let be integers with and . For an integer , an -chorded cycle is a cycle with chords. Gould, Horn and Magnant's conjecture. Every graph of order at least with minimum degree contains vertex-disjoint -chorded cycles.
This conjecture is presented as a common generalization of Corrádi–Hajnal's theorem on disjoint cycles and Hajnal–Szemerédi's theorem on disjoint complete graphs. Its resolution is not specified in the source.
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.