Erdős Problem #703 — Families avoiding one intersection size
Statement
Let be the largest size of a family of subsets of an -element set in which no two members intersect in exactly elements. Estimate for . In particular, for every , is there such that whenever ?
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.