Forbidding just one intersection

Peter Frankl, Z. Füredi

Research output: Contribution to journalArticle

47 Citations (Scopus)

Abstract

Following a conjecture of P. Erdös, we show that if F is a family of k-subsets of and n-set no two of which intersect in exactly l elements then for k ≥ 2l + 2 and n sufficiently large |F| ≤ (k - l - 1 n - l - 1) with equality holding if and only if F consists of all the k-sets containing a fixed (l + 1)-set. In general we show |F| ≤ dknmax;{;l,k - l - 1};, where dk is a constant depending only on k. These results are special cases of more general theorems (Theorem 2.1-2.3).

Original languageEnglish
Pages (from-to)160-176
Number of pages17
JournalJournal of Combinatorial Theory, Series A
Volume39
Issue number2
DOIs
Publication statusPublished - 1985

Fingerprint

Intersection
Intersect
Theorem
Equality
If and only if
Subset
Family

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Forbidding just one intersection. / Frankl, Peter; Füredi, Z.

In: Journal of Combinatorial Theory, Series A, Vol. 39, No. 2, 1985, p. 160-176.

Research output: Contribution to journalArticle

Frankl, Peter ; Füredi, Z. / Forbidding just one intersection. In: Journal of Combinatorial Theory, Series A. 1985 ; Vol. 39, No. 2. pp. 160-176.
@article{e88179c30bc4468395d6527fcd4c4441,
title = "Forbidding just one intersection",
abstract = "Following a conjecture of P. Erd{\"o}s, we show that if F is a family of k-subsets of and n-set no two of which intersect in exactly l elements then for k ≥ 2l + 2 and n sufficiently large |F| ≤ (k - l - 1 n - l - 1) with equality holding if and only if F consists of all the k-sets containing a fixed (l + 1)-set. In general we show |F| ≤ dknmax;{;l,k - l - 1};, where dk is a constant depending only on k. These results are special cases of more general theorems (Theorem 2.1-2.3).",
author = "Peter Frankl and Z. F{\"u}redi",
year = "1985",
doi = "10.1016/0097-3165(85)90035-4",
language = "English",
volume = "39",
pages = "160--176",
journal = "Journal of Combinatorial Theory - Series A",
issn = "0097-3165",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - Forbidding just one intersection

AU - Frankl, Peter

AU - Füredi, Z.

PY - 1985

Y1 - 1985

N2 - Following a conjecture of P. Erdös, we show that if F is a family of k-subsets of and n-set no two of which intersect in exactly l elements then for k ≥ 2l + 2 and n sufficiently large |F| ≤ (k - l - 1 n - l - 1) with equality holding if and only if F consists of all the k-sets containing a fixed (l + 1)-set. In general we show |F| ≤ dknmax;{;l,k - l - 1};, where dk is a constant depending only on k. These results are special cases of more general theorems (Theorem 2.1-2.3).

AB - Following a conjecture of P. Erdös, we show that if F is a family of k-subsets of and n-set no two of which intersect in exactly l elements then for k ≥ 2l + 2 and n sufficiently large |F| ≤ (k - l - 1 n - l - 1) with equality holding if and only if F consists of all the k-sets containing a fixed (l + 1)-set. In general we show |F| ≤ dknmax;{;l,k - l - 1};, where dk is a constant depending only on k. These results are special cases of more general theorems (Theorem 2.1-2.3).

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

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

U2 - 10.1016/0097-3165(85)90035-4

DO - 10.1016/0097-3165(85)90035-4

M3 - Article

AN - SCOPUS:0011476345

VL - 39

SP - 160

EP - 176

JO - Journal of Combinatorial Theory - Series A

JF - Journal of Combinatorial Theory - Series A

SN - 0097-3165

IS - 2

ER -