Gould–Hirohata–Keller conjecture on degree sums for disjoint cycles
Gould–Hirohata–Keller conjecture on degree sums for disjoint cycles
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.
Sources & referencesView supporting material
Primary source
Fuhong Ma and Jin Yan, “The confirmation of a conjecture on disjoint cycles in a graph”, arXiv:1707.02390 (2017).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.