Beyond the Erdo{combining double acute accent}s-Ko-Rado theorem

Peter Frankl, Z. Füredi

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

The exact bound in the Erdo{combining double acute accent}s-Ko-Rado theorem is known [F, W]. It states that if n ≥ (t + 1)(k - t + 1), and F is a t-intersecting family of k-sets of an n-set (|F ∩ F′| ≥ t for all F, F′ ∈ F),then |F≤( n-1 k-1). Define Ar = {F ⊂ {1, 2, ..., n} : |F| = k, |F ∩ {1, 2, ..., t + 2r}| ≥ t + r}. Here it is proved that for n>c t log(t+1) (k - t + 1) one has |F| ≤ maxr |Ar|.

Original languageEnglish
Pages (from-to)182-194
Number of pages13
JournalJournal of Combinatorial Theory, Series A
Volume56
Issue number2
DOIs
Publication statusPublished - 1991

Fingerprint

Acute
Intersecting Family
Theorem

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Beyond the Erdo{combining double acute accent}s-Ko-Rado theorem. / Frankl, Peter; Füredi, Z.

In: Journal of Combinatorial Theory, Series A, Vol. 56, No. 2, 1991, p. 182-194.

Research output: Contribution to journalArticle

@article{05190579a80f45368df43a1e0c6dcb98,
title = "Beyond the Erdo{combining double acute accent}s-Ko-Rado theorem",
abstract = "The exact bound in the Erdo{combining double acute accent}s-Ko-Rado theorem is known [F, W]. It states that if n ≥ (t + 1)(k - t + 1), and F is a t-intersecting family of k-sets of an n-set (|F ∩ F′| ≥ t for all F, F′ ∈ F),then |F≤( n-1 k-1). Define Ar = {F ⊂ {1, 2, ..., n} : |F| = k, |F ∩ {1, 2, ..., t + 2r}| ≥ t + r}. Here it is proved that for n>c t log(t+1) (k - t + 1) one has |F| ≤ maxr |Ar|.",
author = "Peter Frankl and Z. F{\"u}redi",
year = "1991",
doi = "10.1016/0097-3165(91)90031-B",
language = "English",
volume = "56",
pages = "182--194",
journal = "Journal of Combinatorial Theory - Series A",
issn = "0097-3165",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - Beyond the Erdo{combining double acute accent}s-Ko-Rado theorem

AU - Frankl, Peter

AU - Füredi, Z.

PY - 1991

Y1 - 1991

N2 - The exact bound in the Erdo{combining double acute accent}s-Ko-Rado theorem is known [F, W]. It states that if n ≥ (t + 1)(k - t + 1), and F is a t-intersecting family of k-sets of an n-set (|F ∩ F′| ≥ t for all F, F′ ∈ F),then |F≤( n-1 k-1). Define Ar = {F ⊂ {1, 2, ..., n} : |F| = k, |F ∩ {1, 2, ..., t + 2r}| ≥ t + r}. Here it is proved that for n>c t log(t+1) (k - t + 1) one has |F| ≤ maxr |Ar|.

AB - The exact bound in the Erdo{combining double acute accent}s-Ko-Rado theorem is known [F, W]. It states that if n ≥ (t + 1)(k - t + 1), and F is a t-intersecting family of k-sets of an n-set (|F ∩ F′| ≥ t for all F, F′ ∈ F),then |F≤( n-1 k-1). Define Ar = {F ⊂ {1, 2, ..., n} : |F| = k, |F ∩ {1, 2, ..., t + 2r}| ≥ t + r}. Here it is proved that for n>c t log(t+1) (k - t + 1) one has |F| ≤ maxr |Ar|.

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

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

U2 - 10.1016/0097-3165(91)90031-B

DO - 10.1016/0097-3165(91)90031-B

M3 - Article

VL - 56

SP - 182

EP - 194

JO - Journal of Combinatorial Theory - Series A

JF - Journal of Combinatorial Theory - Series A

SN - 0097-3165

IS - 2

ER -