ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.