Erdős matching conjecture: the four-uniform case
Statement
Let , and be integers. If contains no pairwise disjoint members, must
The two candidate extremal families are all -sets inside an -set and all -sets meeting a fixed -set. This is the Erdős matching conjecture (1965), recorded as Problem #1020. This entry concerns only the four-uniform specialization, ; it does not claim to settle arbitrary uniformity. The tracker's forbidden matching parameter is .
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.