ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let [n]={1,…,n}[n]=\{1,\ldots,n\}, and let a kk-multiset on [n][n] be a multiset of cardinality kk whose elements lie in [n][n]. Two multisets are tt-intersecting when their intersection has size at least tt, counted with multiplicity. Let n≥n0(k,t)n\geq n_0(k,t). The tt-intersecting multiset conjecture. If M\mathcal{M} is a tt-intersecting collection of kk-multisets on [n][n], then

∣M∣≤(n+k−t−1k−t).|\mathcal{M}|\leq \binom{n+k-t-1}{k-t}.

Furthermore, equality is achieved if and only if M\mathcal{M} is a trivial collection. This proposes the corresponding Erdős–Ko–Rado-type extremal bound for multisets; the source presents it as an additional direction and gives no resolution.

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.