The maximum size of 3-wise \(t\)-intersecting families
type: Item
instance of: scholarly article
title: The maximum size of 3-wise \(t\)-intersecting families
zbMATH Open document ID: 1110.05096
author: Norihide Tokushige
published in: European Journal of Combinatorics
publication date: 2006-12-07T00:00:00Z
review text: This paper proves a new analogous result of the Erdős-Ko-Rado theorem for 3-wise \(t\)-intersecting families where \(t\) is at least 26. The proof is similar to those originated by Frankl dealing with the original 2-wise \(t\)-intersecting problem, using the shifting operations and a random walk technique.
Mathematics Subject Classification ID: 05D05
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 5077696
zbMATH Keywords: Erdős-Ko-Rado theorem
zbMATH Keywords: shifting technique
zbMATH Keywords: random walk
reviewed by: Péter L. Erdős
MaRDI profile type: Publication
full work available at URL: j.ejc.2005.07.012
OpenAlex ID: W2016392911
cites work: The complete intersection theorem for systems of finite sets
cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: Q4184835
cites work: Families of finite sets satisfying an intersection condition
cites work: The maximum size of 4-wise 2-intersecting and 4-wise 2-union families
cites work: The exact bound in the Erdős-Ko-Rado theorem
DOI: 10.1016/J.EJC.2005.07.012
description: scientific article; zbMATH DE number 5077696