ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let c(n)c(n) be the minimum circumference of a connected vertex-transitive graph on nn vertices, and let d(n)d(n) be the minimum circumference of a connected vertex-transitive digraph on nn vertices. Asymptotic circumference conjecture.

d(n)=Θ(c(n)).d(n)=\Theta(c(n)).

The paper proves a lower bound of order n1/3n^{1/3} for the directed circumference and notes that matching the best known undirected bounds, or showing asymptotic agreement between the directed and undirected cases, would be interesting; the supplied source does not indicate whether this conjecture has been resolved.

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.