Erdős-Ko-Rado theorems for set partitions with certain block size
In this paper, we prove Erdős-Ko-Rado type results for (a) family of set partitions where the size of each block is a multiple of k; and (b) family of set partitions with minimum block size k.
Saved in:
Main Authors: | Ku, Cheng Yeaw, Wong, Kok Bin |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/154617 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
An analogue of the Erdos-Ko-Rado theorem for weak compositions
by: Ku, C.Y., et al.
Published: (2014) -
An analogue of the Hilton-Milner theorem for set partitions
by: Ku, C.Y., et al.
Published: (2014) -
On cross-intersecting families of set partitions
by: Ku, C.Y., et al.
Published: (2014) -
On r-cross intersecting families of sets
by: Ku, C.Y., et al.
Published: (2014) -
On diversity of certain T-intersecting families
by: Ku, Cheng Yeaw, et al.
Published: (2021)