Faudree–Gould–Jacobson–Lesniak–Saito conjecture on 2-factors in Hamiltonian graphs
Statement
Let , and let be a Hamiltonian graph, meaning a graph containing a Hamilton cycle. A -factor of is a spanning -regular subgraph, equivalently a union of vertex-disjoint cycles containing every vertex of .
Faudree–Gould–Jacobson–Lesniak–Saito conjecture. For any there are constants , and such that any Hamiltonian graph of order with
contains a -factor consisting of cycles.
The conjecture asks whether Hamiltonicity permits a minimum-degree threshold below Dirac's bound of while still guaranteeing a -factor with exactly cycles. The surrounding discussion presents this as a conjecture of Faudree, Gould, Jacobson, Lesniak and Saito; no resolution is supplied here.
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.