Tight paths versus cliques
Statement
Improve the bounds. Is it ? Perhaps the lower bound is the truth.
\emph{Related results:}
(Phelps--R"odl) . This is the same as giving the minimum independence number of a linear triple system on points.
(Mubayi--Cooper) for fixed
Here is the construction giving the lower bound for for . Consider the 3-uniform -vertex hypergraph with the vertex set being points of a grid, i.e., , and three points form an edge if and only if they form an L-shape, i.e.,
This hypergraph has independence number and is -free.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.