On the kernel of intersecting families

N. Alon; Z. Füredi

doi:10.1007/BF01788533

On the kernel of intersecting families

N. Alon, Z. Füredi

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

4 Scopus citations

Abstract

Let ℱ be a t-wise s-intersecting family, i.e., |F₁∩ ... ∩ F_t| ≥ s holds for every t members of ℱ. Then there exists a set Y such that |F₁∩ ... ∩ F_t∩ Y| ≥ s still holds for every F₁,..., F_t∈ℱ. Here exponential lower and upper bounds are proven for the possible sizes of Y.

Original language	English (US)
Pages (from-to)	91-94
Number of pages	4
Journal	Graphs and Combinatorics
Volume	3
Issue number	1
DOIs	https://doi.org/10.1007/BF01788533
State	Published - Dec 1987
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1007/BF01788533

Cite this

@article{3c8d7195d0b449eb83915e964737b784,

title = "On the kernel of intersecting families",

abstract = "Let ℱ be a t-wise s-intersecting family, i.e., |F1∩ ... ∩ Ft| ≥ s holds for every t members of ℱ. Then there exists a set Y such that |F1∩ ... ∩ Ft∩ Y| ≥ s still holds for every F1,..., Ft∈ℱ. Here exponential lower and upper bounds are proven for the possible sizes of Y.",

author = "N. Alon and Z. F{\"u}redi",

year = "1987",

month = dec,

doi = "10.1007/BF01788533",

language = "English (US)",

volume = "3",

pages = "91--94",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "1",

}

TY - JOUR

T1 - On the kernel of intersecting families

AU - Alon, N.

AU - Füredi, Z.

PY - 1987/12

Y1 - 1987/12

N2 - Let ℱ be a t-wise s-intersecting family, i.e., |F1∩ ... ∩ Ft| ≥ s holds for every t members of ℱ. Then there exists a set Y such that |F1∩ ... ∩ Ft∩ Y| ≥ s still holds for every F1,..., Ft∈ℱ. Here exponential lower and upper bounds are proven for the possible sizes of Y.

AB - Let ℱ be a t-wise s-intersecting family, i.e., |F1∩ ... ∩ Ft| ≥ s holds for every t members of ℱ. Then there exists a set Y such that |F1∩ ... ∩ Ft∩ Y| ≥ s still holds for every F1,..., Ft∈ℱ. Here exponential lower and upper bounds are proven for the possible sizes of Y.

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

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

U2 - 10.1007/BF01788533

DO - 10.1007/BF01788533

M3 - Article

AN - SCOPUS:0348057821

SN - 0911-0119

VL - 3

SP - 91

EP - 94

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 1

ER -

On the kernel of intersecting families

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this