ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k∈Nk\in\mathbb{N}, and let GG be a Hamiltonian graph, meaning a graph containing a Hamilton cycle. A 22-factor of GG is a spanning 22-regular subgraph, equivalently a union of vertex-disjoint cycles containing every vertex of GG.

Faudree–Gould–Jacobson–Lesniak–Saito conjecture. For any k∈Nk\in\mathbb{N} there are constants ck<1/2c_k<1/2, nkn_k and aka_k such that any Hamiltonian graph GG of order n≥nkn\ge n_k with

δ(G)≥ckn+ak\delta(G)\ge c_k n+a_k

contains a 22-factor consisting of kk cycles.

The conjecture asks whether Hamiltonicity permits a minimum-degree threshold below Dirac's bound of n/2n/2 while still guaranteeing a 22-factor with exactly kk 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 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.