Multiply intersecting families of sets
type: Item
instance of: scholarly article
title: Multiply intersecting families of sets
zbMATH Open document ID: 1045.05085
author: Zsolt Katona
author: Zoltán Füredi
published in: Journal of Combinatorial Theory. Series A
publication date: 2004-08-06T00:00:00Z
review text: This paper studies \(r\)-wise \(s\)-intersecting set systems on an \(n\)-element underlying set, where there is also an upper size-restriction on the intersections: the cardinality of the intersection of any \(l\) sets is at most \(t.\) The authors prove a tight upper bound \((l-1)n\) for the case \(s=1\) and \(l=1.\) They also give the asymptotic solution for the general case.
Mathematics Subject Classification ID: 05D05
Mathematics Subject Classification ID: 05B25
zbMATH DE Number: 2082026
zbMATH Keywords: \(r\)-wise \(s\)-intersecting set systems
zbMATH Keywords: non-trivial intersection, Hamming ball
reviewed by: Péter L. Erdős
MaRDI profile type: Publication
full work available at URL: j.jcta.2004.03.003
OpenAlex ID: W2091849910
cites work: A pushing-pulling method: New proofs of intersection theorems
cites work: Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
cites work: Q4871762
cites work: Q5790167
cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: Multiply-intersecting families
cites work: Q4871772
cites work: Set-systems with restricted multiple intersections
cites work: On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances
cites work: Intersection theorems for systems of finite sets
cites work: Intersecting families of sets, no \(l\) containing two common elements
cites work: The Lines and Planes Connecting the Points of a Finite Set
cites work: An extension of a Frankl-Füredi theorem
cites work: Proof of a conjecture of Frankl and Füredi
cites work: Multilinear polynomials and a conjecture of Frankl and Füredi
DOI: 10.1016/J.JCTA.2004.03.003
description: scientific article; zbMATH DE number 2082026