An Extension of the Erdos-Ko-Rado Theorem to uniform set partitions
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 Erdos-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 .
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.