ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a random 33-regular graph on nn vertices and define

K0(n)=11−12log⁡23 log⁡2(2n/e).K_0(n)=\frac{1}{1-\frac12\log_2 3}\,\log_2(2n/e).

If k≥K0(n)k\ge K_0(n) is a divisor of nn, then GG contains a kk-cycle factor with high probability; whereas if

k≤K0(n)−log⁡2nn,k\le K_0(n)-\frac{\log^2 n}{n},

then, with high probability, GG contains no kk-cycle factor.

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.