The maximum size of 3-wise t-intersecting families
From MaRDI portal
Publication:854817
DOI10.1016/J.EJC.2005.07.012zbMATH Open1110.05096OpenAlexW2016392911MaRDI QIDQ854817FDOQ854817
Authors: Norihide Tokushige 
Publication date: 7 December 2006
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2005.07.012
Recommendations
Cites Work
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The complete intersection theorem for systems of finite sets
- Title not available (Why is that?)
- The exact bound in the Erdős-Ko-Rado theorem
- The maximum size of 4-wise 2-intersecting and 4-wise 2-union families
- Families of finite sets satisfying an intersection condition
Cited In (12)
- An extension of the Erdős–Ko–Rado Theorem
- A product version of the Erdős-Ko-Rado theorem
- Nearly extremal non-trivial cross \(t\)-intersecting families and \(r\)-wise \(t\)-intersecting families
- On symmetric 3-wise intersecting families
- EKR type inequalities for 4-wise intersecting families
- A multiply intersecting Erdős-Ko-Rado theorem -- the principal case
- The maximum size of 4-wise 2-intersecting and 4-wise 2-union families
- Short proofs of three results about intersecting systems
- Multiply-intersecting families revisited
- Beyond the Erdős-Ko-Rado theorem
- The maximum size of intersecting and union families of sets
- The maximum measure of 3-wise \(t\)-intersecting families
This page was built for publication: The maximum size of 3-wise \(t\)-intersecting families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854817)
