Erdős Problem #83 — Two-intersecting half-sized subsets of a 4n-set
Statement
If every member of a family is a -subset of a -element set and any two members intersect in at least two elements, is at most ?
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.