English

On Maximal Left-Compressed Intersecting Families Generated by a Collection of Subsets of [$n$]

Combinatorics 2025-11-11 v1

Abstract

We provide a characterization of maximal left-compressed families based on their generating sets G2[n]\mathcal{G}\subseteq 2^{[n]}. We show that there is a one-to-one correspondence between maximal left-compressed families A([n]k)\mathcal{A}\subseteq \binom{[n]}{k} and principal generating sets. Moreover, we give a complete description of maximal left-compressed intersecting families having exactly two maximal generators. Based on this, for any X[2,n]X\subseteq [2,n], we compare A(X)\mathcal{A}(X), where A\mathcal{A} is a rank-2 maximal left-compressed intersecting family with exactly two maximal generators, and S(X)\mathcal{S}(X), where S\mathcal{S} denotes the Star family.

Keywords

Cite

@article{arxiv.2511.05917,
  title  = {On Maximal Left-Compressed Intersecting Families Generated by a Collection of Subsets of [$n$]},
  author = {Tuan Nguyen},
  journal= {arXiv preprint arXiv:2511.05917},
  year   = {2025}
}