Intersection properties of systems of finite sets

M. Deza, P. Erdős, P. Frankl

Research output: Contribution to journalArticle

45 Citations (Scopus)

Abstract

Let X be a finite set of cardinality n. If L = (l1,…, lr) is a set of nonnegative integers with l12<… <lr, and & is a natural number, then by an (n, L, k)-system we mean a collection of k-element subsets of X such that the intersection of any two different sets has cardinality belonging to L. We prove that if A is an (n, L, k)-system, with A > cnr-1 (c = c(k) is a constant depending on k), then (i) there exists an l1-element subset D of X such that D is contained in every member of A (ii) (l2-l1)(l3-l2)… (iii) (Πri=1 (n-li)/(k-li) ≥ A (for n ≥ n0(k)). Parts of the results are generalized for the following cases: (a) we consider t-wise intersections, where t ≥ 2; (b) the condition A= k is replaced by A K where K is a set of integers; (c) the intersection condition is replaced by the following: Among q +1 different members A1,…, Aq+1 there are always two, Ai, Aj, such that e Ai ∩ Aj ∈ L. We consider some related problems. An open question: let L’ ⊂ L do there exist an [n, L, k)-system of maximal cardinality (A) and an (n, L’, k)-system of maximal cardinality (A’) such that A A’?.

Original languageEnglish
Pages (from-to)369-384
Number of pages16
JournalProceedings of the London Mathematical Society
Volumes3-36
Issue number2
DOIs
Publication statusPublished - 1978

Fingerprint

Finite Set
Cardinality
Intersection
Integer
Non-negative
Subset

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Intersection properties of systems of finite sets. / Deza, M.; Erdős, P.; Frankl, P.

In: Proceedings of the London Mathematical Society, Vol. s3-36, No. 2, 1978, p. 369-384.

Research output: Contribution to journalArticle

@article{07e255dc55cd4e2b84378742db12f029,
title = "Intersection properties of systems of finite sets",
abstract = "Let X be a finite set of cardinality n. If L = (l1,…, lr) is a set of nonnegative integers with l12<… r, and & is a natural number, then by an (n, L, k)-system we mean a collection of k-element subsets of X such that the intersection of any two different sets has cardinality belonging to L. We prove that if A is an (n, L, k)-system, with A > cnr-1 (c = c(k) is a constant depending on k), then (i) there exists an l1-element subset D of X such that D is contained in every member of A (ii) (l2-l1)(l3-l2)… (iii) (Πri=1 (n-li)/(k-li) ≥ A (for n ≥ n0(k)). Parts of the results are generalized for the following cases: (a) we consider t-wise intersections, where t ≥ 2; (b) the condition A= k is replaced by A K where K is a set of integers; (c) the intersection condition is replaced by the following: Among q +1 different members A1,…, Aq+1 there are always two, Ai, Aj, such that e Ai ∩ Aj ∈ L. We consider some related problems. An open question: let L’ ⊂ L do there exist an [n, L, k)-system of maximal cardinality (A) and an (n, L’, k)-system of maximal cardinality (A’) such that A A’?.",
author = "M. Deza and P. Erdős and P. Frankl",
year = "1978",
doi = "10.1112/plms/s3-36.2.369",
language = "English",
volume = "s3-36",
pages = "369--384",
journal = "Proceedings of the London Mathematical Society",
issn = "0024-6115",
publisher = "Oxford University Press",
number = "2",

}

TY - JOUR

T1 - Intersection properties of systems of finite sets

AU - Deza, M.

AU - Erdős, P.

AU - Frankl, P.

PY - 1978

Y1 - 1978

N2 - Let X be a finite set of cardinality n. If L = (l1,…, lr) is a set of nonnegative integers with l12<… r, and & is a natural number, then by an (n, L, k)-system we mean a collection of k-element subsets of X such that the intersection of any two different sets has cardinality belonging to L. We prove that if A is an (n, L, k)-system, with A > cnr-1 (c = c(k) is a constant depending on k), then (i) there exists an l1-element subset D of X such that D is contained in every member of A (ii) (l2-l1)(l3-l2)… (iii) (Πri=1 (n-li)/(k-li) ≥ A (for n ≥ n0(k)). Parts of the results are generalized for the following cases: (a) we consider t-wise intersections, where t ≥ 2; (b) the condition A= k is replaced by A K where K is a set of integers; (c) the intersection condition is replaced by the following: Among q +1 different members A1,…, Aq+1 there are always two, Ai, Aj, such that e Ai ∩ Aj ∈ L. We consider some related problems. An open question: let L’ ⊂ L do there exist an [n, L, k)-system of maximal cardinality (A) and an (n, L’, k)-system of maximal cardinality (A’) such that A A’?.

AB - Let X be a finite set of cardinality n. If L = (l1,…, lr) is a set of nonnegative integers with l12<… r, and & is a natural number, then by an (n, L, k)-system we mean a collection of k-element subsets of X such that the intersection of any two different sets has cardinality belonging to L. We prove that if A is an (n, L, k)-system, with A > cnr-1 (c = c(k) is a constant depending on k), then (i) there exists an l1-element subset D of X such that D is contained in every member of A (ii) (l2-l1)(l3-l2)… (iii) (Πri=1 (n-li)/(k-li) ≥ A (for n ≥ n0(k)). Parts of the results are generalized for the following cases: (a) we consider t-wise intersections, where t ≥ 2; (b) the condition A= k is replaced by A K where K is a set of integers; (c) the intersection condition is replaced by the following: Among q +1 different members A1,…, Aq+1 there are always two, Ai, Aj, such that e Ai ∩ Aj ∈ L. We consider some related problems. An open question: let L’ ⊂ L do there exist an [n, L, k)-system of maximal cardinality (A) and an (n, L’, k)-system of maximal cardinality (A’) such that A A’?.

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

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

U2 - 10.1112/plms/s3-36.2.369

DO - 10.1112/plms/s3-36.2.369

M3 - Article

VL - s3-36

SP - 369

EP - 384

JO - Proceedings of the London Mathematical Society

JF - Proceedings of the London Mathematical Society

SN - 0024-6115

IS - 2

ER -