Gould–Hirohata–Keller conjecture on degree sums for disjoint cycles
Statement
Let be a graph of sufficiently large order. For an integer , let denote the minimum degree sum over all sets of pairwise nonadjacent vertices of . Gould–Hirohata–Keller conjecture. If for any two integers and , then contains disjoint cycles. This conjecture proposes a general degree-sum condition extending known sharp results for disjoint cycles; its resolution would clarify how degree sums over independent vertex sets guarantee collections of vertex-disjoint cycles.
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.