ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let c,kc,k be integers with c≥2c\geq 2 and k≥1k\geq 1. For an integer r≥0r\geq 0, an rr-chorded cycle is a cycle with rr chords. Gould, Horn and Magnant's conjecture. Every graph GG of order at least (c+1)k(c+1)k with minimum degree δ(G)≥ck\delta(G)\geq ck contains kk vertex-disjoint (c+1)(c−2)2\frac{(c+1)(c-2)}{2}-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 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.