Erdős Problem #1024 — Independent sets in linear triple systems
Statement
Let be the minimum, over all -uniform hypergraphs on vertices in which any two edges intersect in at most one vertex, of the maximum size of a vertex set containing no edge. Determine the order of growth of .
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.