The t-intersecting multiset conjecture
Statement
Let , and let a -multiset on be a multiset of cardinality whose elements lie in . Two multisets are -intersecting when their intersection has size at least , counted with multiplicity. Let . The -intersecting multiset conjecture. If is a -intersecting collection of -multisets on , then
Furthermore, equality is achieved if and only if 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.