The weighted complete intersection theorem

Yuval Filmus

doi:https://doi.org/10.1016/j.jcta.2017.04.008

The weighted complete intersection theorem

Yuval Filmus

Computer Science

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of a k-uniform t-intersecting family on n points, and describes all optimal families for t≥2. We extend this theorem to the weighted setting, in which we consider unconstrained families on n points with respect to the measure μ_p given by μ_p(A)=p^|A|(1−p)^n−|A|. Our theorem gives the maximum μ_p measure of a t-intersecting family on n points, and describes all optimal families for t≥2.

Original language	English
Pages (from-to)	84-101
Number of pages	18
Journal	Journal of Combinatorial Theory. Series A
Volume	151
DOIs	https://doi.org/10.1016/j.jcta.2017.04.008
State	Published - 1 Oct 2017

Keywords

Ahlswede–Khachatrian theorem
Erdős–Ko–Rado theorem
Intersecting families
Shifting

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

https://doi.org/10.1016/j.jcta.2017.04.008

Cite this

@article{58486ce4a92342248bc526941da7d67b,

title = "The weighted complete intersection theorem",

abstract = "The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of a k-uniform t-intersecting family on n points, and describes all optimal families for t≥2. We extend this theorem to the weighted setting, in which we consider unconstrained families on n points with respect to the measure μp given by μp(A)=p|A|(1−p)n−|A|. Our theorem gives the maximum μp measure of a t-intersecting family on n points, and describes all optimal families for t≥2.",

keywords = "Ahlswede–Khachatrian theorem, Erd{\H o}s–Ko–Rado theorem, Intersecting families, Shifting",

author = "Yuval Filmus",

note = "Publisher Copyright: {\textcopyright} 2017 Elsevier Inc.",

year = "2017",

month = oct,

day = "1",

doi = "https://doi.org/10.1016/j.jcta.2017.04.008",

language = "الإنجليزيّة",

volume = "151",

pages = "84--101",

journal = "Journal of Combinatorial Theory. Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - The weighted complete intersection theorem

AU - Filmus, Yuval

PY - 2017/10/1

Y1 - 2017/10/1

N2 - The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of a k-uniform t-intersecting family on n points, and describes all optimal families for t≥2. We extend this theorem to the weighted setting, in which we consider unconstrained families on n points with respect to the measure μp given by μp(A)=p|A|(1−p)n−|A|. Our theorem gives the maximum μp measure of a t-intersecting family on n points, and describes all optimal families for t≥2.

AB - The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of a k-uniform t-intersecting family on n points, and describes all optimal families for t≥2. We extend this theorem to the weighted setting, in which we consider unconstrained families on n points with respect to the measure μp given by μp(A)=p|A|(1−p)n−|A|. Our theorem gives the maximum μp measure of a t-intersecting family on n points, and describes all optimal families for t≥2.

KW - Ahlswede–Khachatrian theorem

KW - Erdős–Ko–Rado theorem

KW - Intersecting families

KW - Shifting

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

U2 - https://doi.org/10.1016/j.jcta.2017.04.008

DO - https://doi.org/10.1016/j.jcta.2017.04.008

M3 - مقالة

SN - 0097-3165

VL - 151

SP - 84

EP - 101

JO - Journal of Combinatorial Theory. Series A

JF - Journal of Combinatorial Theory. Series A

ER -

The weighted complete intersection theorem

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this