The complete nontrivial-intersection theorem for systems of finite sets
type: Item
instance of: scholarly article
title: The complete nontrivial-intersection theorem for systems of finite sets
zbMATH Open document ID: 0861.05058
author: Levon H. Khachatrian
author: Rudolf Ahlswede
published in: Journal of Combinatorial Theory. Series A
publication date: 1996-10-14T00:00:00Z
review text: Extending earlier results of \textit{P. Frankl} [On intersecting families of finite sets, J. Comb. Theory, Ser. A 24, 146-161 (1978; Zbl 0384.05002)] the maximum cardinality of \(k\)-element subsets of an \(n\)-element set with pairwise intersection of size at least \(t\) is determined if it is nontrivial, i.e., the intersection of all sets has less than \(t\) elements.
Mathematics Subject Classification ID: 05D05
zbMATH DE Number: 934995
zbMATH Keywords: intersection theorem
zbMATH Keywords: intersecting families
reviewed by: Péter Komjáth
MaRDI profile type: Publication
full work available at URL: jcta.1996.0092
OpenAlex ID: W2089616955
Wikidata QID: Q105583193
DOI: 10.1006/JCTA.1996.0092
Recommended article: The complete intersection theorem for systems of finite sets
Recommended article: An intersection theorem for systems of finite sets
Recommended article: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
Recommended article: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
Recommended article: An intersection theorem for systems of sets
Recommended article: Intersection Properties of Systems of Finite Sets
Recommended article: Q4163226
Recommended article: Intersection Theorems for Systems of Sets
Recommended article: Systems of nonempty intersection theorems with applications
Recommended article: Intersection Theorems for Systems of Sets (II)
description: scientific article; zbMATH DE number 934995