Exact deficit identity for recursive tight-cycle constructions
Statement
Mubayi and R"odl~\cite{mubayi+rodl:02} have given bounds on , where is the tight -graph -cycle:
In particular, the lower bound comes from the following construction: partition the vertex set into two parts and , take all triples that intersect precisely in vertices, and recursively repeat this construction within . Finding the optimal ratio between and gives the required. Razborov's~\cite{razborov:10} flag algebra computations showed that (note that ). This makes the following conjecture plausible.
Record
- Source
- Added
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.