A discrete isodiametric result

The Erdos-Ko-Rado theorem for multisets

Z. Füredi, Dániel Gerbner, Máté Vizer

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

There are many generalizations of the Erdos-Ko-Rado theorem. Here the new results (and problems) concern families of t-intersecting k-element multisets of an n-set. We point out connections to coding theory and geometry. We verify the conjecture that for n≥t(k-t)+2 such a family can have at most (n+k-t-1k-t) members.

Original languageEnglish
JournalEuropean Journal of Combinatorics
DOIs
Publication statusAccepted/In press - 2015

Fingerprint

Multiset
Erdös
Coding Theory
Theorem
Verify
Family
Generalization

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Cite this

A discrete isodiametric result : The Erdos-Ko-Rado theorem for multisets. / Füredi, Z.; Gerbner, Dániel; Vizer, Máté.

In: European Journal of Combinatorics, 2015.

Research output: Contribution to journalArticle

@article{017fdb9c94664be78ca8eb573284020a,
title = "A discrete isodiametric result: The Erdos-Ko-Rado theorem for multisets",
abstract = "There are many generalizations of the Erdos-Ko-Rado theorem. Here the new results (and problems) concern families of t-intersecting k-element multisets of an n-set. We point out connections to coding theory and geometry. We verify the conjecture that for n≥t(k-t)+2 such a family can have at most (n+k-t-1k-t) members.",
author = "Z. F{\"u}redi and D{\'a}niel Gerbner and M{\'a}t{\'e} Vizer",
year = "2015",
doi = "10.1016/j.ejc.2015.02.023",
language = "English",
journal = "European Journal of Combinatorics",
issn = "0195-6698",
publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - A discrete isodiametric result

T2 - The Erdos-Ko-Rado theorem for multisets

AU - Füredi, Z.

AU - Gerbner, Dániel

AU - Vizer, Máté

PY - 2015

Y1 - 2015

N2 - There are many generalizations of the Erdos-Ko-Rado theorem. Here the new results (and problems) concern families of t-intersecting k-element multisets of an n-set. We point out connections to coding theory and geometry. We verify the conjecture that for n≥t(k-t)+2 such a family can have at most (n+k-t-1k-t) members.

AB - There are many generalizations of the Erdos-Ko-Rado theorem. Here the new results (and problems) concern families of t-intersecting k-element multisets of an n-set. We point out connections to coding theory and geometry. We verify the conjecture that for n≥t(k-t)+2 such a family can have at most (n+k-t-1k-t) members.

UR - http://www.scopus.com/inward/record.url?scp=84924710201&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84924710201&partnerID=8YFLogxK

U2 - 10.1016/j.ejc.2015.02.023

DO - 10.1016/j.ejc.2015.02.023

M3 - Article

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

SN - 0195-6698

ER -