On the d-cluster generalization of Erdos-Ko-Rado

Abstract

If 2 d k and n dk/(d-1), a d-cluster is defined to be a collection of d elements of [n] k with empty intersection and union of size no more than 2k. Mubayi conjectured that the largest size of a d-cluster-free family F ⊂ [n] k is n-1 k-1, with equality holding only for a maximum-sized star. Here, we resolve Mubayi's conjecture and prove a slightly stronger result, thus completing a new generalization of the Erdos-Ko-Rado Theorem.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…