ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be a positive integer and let vecp=(p,1,…,1)vec{p}=(p,1,\ldots,1). For n≥(s+1)kn\geq (s+1)k, define fvecp(n,k,s)f_{vec{p}}(n,k,s) as the maximum weighted sum associated with s+1s+1 overlapping families of kk-subsets of [n][n], with weights given by vecpvec{p}. Weighted Erdős matching conjecture.

fvecp(n,k,s)=max⁡{s(nk),(p+s)((s+1)k−1k),(p+s)((nk)−(n−sk))}.f_{vec{p}}(n,k,s) = \max \left\{ s\binom{n}{k}, (p+s) \binom{(s+1)k-1}{k},(p+s)\left(\binom{n}{k}-\binom{n-s}{k}\right)\right\}.

The conjecture would imply all the results in the paper and, in the special case where all the families coincide, the Erdős matching conjecture. Its status is not resolved in the supplied source.

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.