Abstract
A (k,ℓ)-partition is a set partition which has ℓ blocks each of size k. Two uniform set partitions P and Q are said to be partially t-intersecting if there exist blocks Pi in P and Qj in Q such that |Pi∩Qj| ≥ t. In this paper we prove a version of the Erdős-Ko-Rado theorem for partially 2-intersecting (k,ℓ)-partitions. In particular, we show for ℓ sufficiently large, the set of all (k,ℓ)-partitions in which a block contains a fixed pair is the largest set of 2-partially intersecting (k,ℓ)-partitions. For for k = 3, we show this result holds for all ℓ.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
