On the kernel of intersecting families
type: Item
instance of: scholarly article
title: On the kernel of intersecting families
zbMATH Open document ID: 0651.05004
DOI: 10.1007/BF01788533
published in: Graphs and Combinatorics
publication date: 1987-01-01T00:00:00Z
review text: Let \({\mathcal F}\) be a t-wise s-intersecting family, i.e., \(| F_ 1\cap...\cap F_ t| \geq s\) holds for every t members of \({\mathcal F}\). Then there exists a set Y such that \(| F_ 1\cap...\cap F_ t\cap Y| \geq s\) still holds for every \(F_ 1,...,F_ t\in {\mathcal F}\). Here exponential lower and upper bounds are proven for the possible sizes of Y.
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 4061242
zbMATH Keywords: t-wise s-intersecting family
author: Noga Alon
author: Zoltán Füredi
MaRDI profile type: Publication
cites work: An extremal problem for sets with applications to graph theory
cites work: A simple proof of the upper bound theorem
cites work: Q5331500
cites work: Interpolation of functions over a measure space and conjectures about memory
cites work: On intersecting families of finite sets
cites work: An extremal problem for two families of sets
cites work: Finite projective spaces and intersecting hypergraphs
cites work: Geometrical solution of an intersection problem for two hypergraphs
cites work: Q3218170
cites work: Intersection patterns of convex sets
cites work: Q4133994
cites work: Critical hypergraphs and interesting set-pair systems
full work available at URL: https://doi.org/10.1007/bf01788533
OpenAlex ID: W2007737827
description: scientific article; zbMATH DE number 4061242