ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let r≥2r\geq2, s≥1s\geq1 and n≥r(s+1)n\geq r(s+1) be integers. If F⊆([n]r)\mathcal F\subseteq\binom{[n]}r contains no s+1s+1 pairwise disjoint members, must

∣F∣≤max⁡{(r(s+1)−1r),(nr)−(n−sr)}?|\mathcal F|\leq\max\left\{\binom{r(s+1)-1}{r},\binom nr-\binom{n-s}{r}\right\}?

The two candidate extremal families are all rr-sets inside an (r(s+1)−1)(r(s+1)-1)-set and all rr-sets meeting a fixed ss-set. This is the Erdős matching conjecture (1965), recorded as Problem #1020. This entry concerns only the four-uniform specialization, r=4r=4; it does not claim to settle arbitrary uniformity. The tracker's forbidden matching parameter is k=s+1k=s+1.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.