An analogue of the Hilton-Milner theorem for set partitions

DOI10.1016/j.jcta.2013.05.001zbMath1314.05021arXiv1109.0417OpenAlexW2167233799WikidataQ105583638 ScholiaQ105583638MaRDI QIDQ2349184

Cheng Yeaw Ku, Kok Bin Wong

Publication date: 19 June 2015

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

Full work available at URL: https://arxiv.org/abs/1109.0417

zbMATH Keywords

intersecting familyErdős-Ko-Rado theoremset partitionsHilton-Milner theorem

Mathematics Subject Classification ID

Partitions of sets (05A18) Bell and Stirling numbers (11B73)

Related Items

The Hilton-Milner theorem for finite affine spaces, 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, A non-trivial intersection theorem for permutations with fixed number of cycles, The Hilton-Milner theorem for the distance-regular graphs of bilinear forms, The Hilton-Milner theorem for attenuated spaces, Erdős-Ko-Rado theorems for set partitions with certain block size, Unnamed Item, On \(r\)-cross \(t\)-intersecting families for weak compositions, A Deza-Frankl type theorem for set partitions