The \(t\)-intersection problem in the truncated Boolean lattice

DOI10.1006/eujc.2002.0590zbMath1015.05088OpenAlexW2021798559MaRDI QIDQ1864563

Konrad Engel, Christian Bey, Levon H. Khachatrian

Publication date: 18 March 2003

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.2002.0590

zbMATH Keywords

Erdős-Ko-Rado theoremAhlswede-Khachatrian theoremco-intersecting systemsintersecting systemstruncated Boolean algebra

Mathematics Subject Classification ID

Extremal set theory (05D05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complete intersection theorem for systems of finite sets
• An Erdős-Ko-Rado theorem for integer sequences of given rank
• The proof of a conjecture of G. O. H. Katona
• The diametric theorem in Hamming spaces---optimal anticodes
• On families of finite sets with bounds on unions and intersections
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Asymptotic Methods in Enumeration
• Intersection theorems for systems of finite sets
• A pushing-pulling method: New proofs of intersection theorems

This page was built for publication: The \(t\)-intersection problem in the truncated Boolean lattice