Minimizing the Number of Unions
The Electronic Journal of Combinatorics · 13.03.2026 · 33 (1)
DOI: 10.37236/13702 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 13.03.2026. Verfasst von Žarko Ranđelović.
Abstract (Originalsprache)
For a given number of $k$-sets, how should we choose them so as to minimize the union-closed family that they generate? Our main aim in this paper is to show that, if $\mathcal{A}$ is a family of $k$-sets of size $\binom{t}{k}$, and $t$ is sufficiently large, then the union-closed family generated by $\mathcal{A}$ has size at least that generated by the family of all $k$-sets from a $t$-set. This proves (for this size of family) a conjecture of Roberts. We also make some related conjectures, and give some other results, including a new proof of the result of Leck, Roberts and Simpson that exactly determines this minimum (for all sizes of the family) when $k=2$, as well as resolving the conjecture of Roberts when the size of the family is very close to $\binom{t}{k}$.
Zitieren
APA
Ranđelović, Ž. (2026). Minimizing the Number of Unions. The Electronic Journal of Combinatorics, 33(1). https://doi.org/10.37236/13702
Vancouver
Ranđelović Ž. Minimizing the Number of Unions. The Electronic Journal of Combinatorics. 2026;33(1). doi:10.37236/13702
BibTeX
@article{Ranelovi2026,
author = {Ranđelović, Žarko},
title = {Minimizing the Number of Unions},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {1},
doi = {10.37236/13702}
}
EUVIMED