ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let SeS_e and SoS_o denote the sets of lengths of even and odd cycles contained in GG, respectively. Let d≥3d\geq 3.

Faudree–Gould–Jacobson–Magnant conjecture. If GG is a 2-connected graph on n≥2dn\geq 2d vertices with minimum degree δ(G)=d\delta(G)=d, then

∣Se∣≥d−1,|S_e|\geq d-1,

and, if GG is not bipartite, then

∣So∣≥d.|S_o|\geq d.

The conjecture concerns how many distinct even and odd cycle lengths are forced by 2-connectivity and minimum degree. The source notes that the case d=3d=3 was confirmed, while the general statement is presented as a motivation for the work.

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.