Dense-graph upper-bound conjecture for the number of cycles
Statement
Let denote the number of cycles in a graph . For , let be sufficiently large, let be a graph on vertices, and let be its average degree. Dense-cycle upper-bound conjecture. Every such graph satisfies
The conjecture is motivated by the comparison with random graphs and the asymptotic number of cycles in the complete graph. The source does not provide a resolution, so the claim remains open.
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.