Faudree–Gould–Jacobson–Magnant cycle spectra conjecture
Statement
Let be a graph, and let and denote the sets of lengths of even and odd cycles contained in , respectively. Let .
Faudree–Gould–Jacobson–Magnant conjecture. If is a 2-connected graph on vertices with minimum degree , then
and, if is not bipartite, then
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 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.