ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let C(G)C(G) denote the number of cycles in a graph GG. For alpha∈(0,1]alpha\in(0,1], let nn be sufficiently large, let GG be a graph on nn vertices, and let d=αnd=\alpha n be its average degree. Dense-cycle upper-bound conjecture. Every such graph satisfies

C(G)≤(1+o(1))n(de)n.C(G)\leq(1+o(1))^n\left(\frac{d}{e}\right)^n.

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 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.