Gould–Hirohata–Keller conjecture on degree sums for disjoint cycles

About 9 years old · traced to

Let GG be a graph of sufficiently large order. For an integer t≥1t\geq 1, let σt(G)\sigma_t(G) denote the minimum degree sum over all sets of tt pairwise nonadjacent vertices of GG. Gould–Hirohata–Keller conjecture. If σt(G)≥2kt−t+1\sigma_t(G)\geq 2kt-t+1 for any two integers k≥2k\geq 2 and t≥4t\geq 4, then GG contains kk 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.

References

Primary source

Fuhong Ma and Jin Yan, “The confirmation of a conjecture on disjoint cycles in a graph”, arXiv:1707.02390 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.