English

On the $d$-cluster generalization of Erd\H{o}s-Ko-Rado

Combinatorics 2022-06-13 v2

Abstract

If 2dk2 \le d \le k and ndk/(d1)n \ge dk/(d-1), a dd-cluster is defined to be a collection of dd elements of ([n]k){[n] \choose k} with empty intersection and union of size no more than 2k2k. Mubayi conjectured that the largest size of a dd-cluster-free family F([n]k)\mathcal{F} \subset {[n] \choose k} is (n1k1){n-1 \choose 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 Erd\H{o}s-Ko-Rado Theorem.

Keywords

Cite

@article{arxiv.1812.11153,
  title  = {On the $d$-cluster generalization of Erd\H{o}s-Ko-Rado},
  author = {Gabriel Currier},
  journal= {arXiv preprint arXiv:1812.11153},
  year   = {2022}
}

Comments

Second part removed, important references added, proof simplified