Erdős-Ko-Rado theorems for set partitions with certain block size

DOI10.1016/j.jcta.2019.105180zbMath1433.05309MaRDI QIDQ2299629

Cheng Yeaw Ku, Kok Bin Wong

Publication date: 21 February 2020

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2019.105180

zbMATH Keywords

set partitions; Erdős-Ko-Rado; \(t\)-intersecting family

Mathematics Subject Classification ID

05D05: Extremal set theory

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Intersection problems in the \(q\)-ary cube
• An analogue of the Erdős-Ko-Rado theorem for weak compositions
• An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
• An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families
• A product version of the Erdős-Ko-Rado theorem
• Stability for \(t\)-intersecting families of permutations
• The complete intersection theorem for systems of finite sets
• Multiply union families in \(\mathbb{N}^n\)
• The exact bound in the Erdős-Ko-Rado theorem
• A non-trivial intersection theorem for permutations with fixed number of cycles
• Erdős-Ko-Rado theorems for permutations and set partitions
• Some Erdős-Ko-Rado theorems for injections
• A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
• The Erdős-Ko-Rado theorem for vector spaces
• An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
• The diametric theorem in Hamming spaces---optimal anticodes
• On cross-intersecting families of set partitions
• Shadows and intersections in vector spaces
• On \(r\)-cross \(t\)-intersecting families for weak compositions
• A Deza-Frankl type theorem for set partitions
• An analogue of the Hilton-Milner theorem for set partitions
• Forbidding just one intersection, for permutations
• The maximum sum and the maximum product of sizes of cross-intersecting families
• Erdős-Ko-Rado theorems for uniform set-partition systems
• On r-Cross Intersecting Families of Sets
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• AN ANALOGUE OF THE HILTON-MILNER THEOREM FOR WEAK COMPOSITIONS
• AN ERDŐS-KO-RADO THEOREM FOR MINIMAL COVERS
• Intersecting families of permutations
• On intersecting families of finite sets
• Intersecting families of permutations