ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Mubayi and R"odl~\cite{mubayi+rodl:02} have given bounds on π(C53)\pi(C_5^3), where C53C_5^3 is the tight 33-graph 55-cycle:

C53={123,234,345,451,512}.C_5^3=\{123,234,345,451,512\}.

In particular, the lower bound π(C53)≥23−3\pi(C_5^3)\ge 2\sqrt3-3 comes from the following construction: partition the vertex set into two parts AA and BB, take all triples that intersect AA precisely in 22 vertices, and recursively repeat this construction within BB. Finding the optimal ratio between ∣A∣|A| and ∣B∣|B| gives the required. Razborov's~\cite{razborov:10} flag algebra computations showed that π(C53)<0.4683\pi(C_5^3)< 0.4683 (note that 23−3=0.4641...2\sqrt3-3=0.4641...). This makes the following conjecture plausible.

π(C53)=23−3\pi(C_5^3)=2\sqrt3-3

Record

Added
Links

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.