A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets

DOI10.1016/j.ejc.2015.02.023zbMath1315.05003arXiv1212.1071OpenAlexW2065647202MaRDI QIDQ2346594

Dániel Gerbner, Máté Vizer, Zoltan Fueredi

Publication date: 2 June 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.1071

zbMATH Keywords

isodiametric problemmaximal volume

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial inequalities (05A20)

Related Items (6)

The maximum product of sizes of cross-intersecting families ⋮ Intersection problems in the \(q\)-ary cube ⋮ Intersection theorems for multisets ⋮ The maximum product of weights of cross-intersecting families ⋮ Vector sum-intersection theorems ⋮ A sharp bound for the product of weights of cross-intersecting families

Cites Work

• Unnamed Item
• Unnamed Item
• The complete intersection theorem for systems of finite sets
• The exact bound in the Erdős-Ko-Rado theorem
• Diameter and radius in the Manhattan metric
• The diametric theorem in Hamming spaces---optimal anticodes
• Maximal sets of given diameter in the grid and the torus
• A generalization of the Erdős-Ko-Rado theorem on finite set systems
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection theorems for systems of finite sets
• On a combinatorial conjecture of Erdös
• An Erdős-Ko-Rado theorem for multisets

This page was built for publication: A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets