Colorful Fractional Helly Theorem via Weak Saturation
The Electronic Journal of Combinatorics · 2026-05-08 · 33 (2)
DOI: 10.37236/14093 ↗At a glance
Journal article in The Electronic Journal of Combinatorics, published online on 2026-05-08. Written by Debsoumya Chakraborti and 3 co-authors.
Abstract (original language)
Two celebrated extensions of the classical Helly's theorem are the fractional Helly theorem and the colorful Helly theorem. Bulavka, Goodarzi, and Tancer recently established the optimal bound for the unified generalization of the fractional and the colorful Helly theorems using a colored extension of the exterior algebra. In this paper, we combinatorially reduce both the fractional Helly theorem and its colorful version to a classical problem in extremal combinatorics known as weak saturation. No such results connecting the fractional Helly theorem and weak saturation are known in the long history of literature. These reductions, along with basic linear algebraic arguments for the reduced weak saturation problems, let us give new short proofs of the optimal bounds for both the fractional Helly theorem and its colorful version without using exterior algebra.
Cite
APA
Chakraborti, D., Cho, M., Kim, J., & Kim, M. (2026). Colorful Fractional Helly Theorem via Weak Saturation. The Electronic Journal of Combinatorics, 33(2). https://doi.org/10.37236/14093
Vancouver
Chakraborti D, Cho M, Kim J, Kim M. Colorful Fractional Helly Theorem via Weak Saturation. The Electronic Journal of Combinatorics. 2026;33(2). doi:10.37236/14093
BibTeX
@article{Chakraborti2026,
author = {Chakraborti, Debsoumya and Cho, Minho and Kim, Jinha and Kim, Minki},
title = {Colorful Fractional Helly Theorem via Weak Saturation},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {2},
doi = {10.37236/14093}
}
EUVIMED