Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > MOONFLOWERS:
Reports tagged with Moonflowers:
TR26-069 | 9th May 2026
Shachar Lovett, Raghu Meka, Yimeng Wang

Moonflowers and efficient code sparsification

We introduce \emph{moonflowers}, a weaker analogue of sunflowers. A family of sets $S_1,\ldots,S_k$ is a $k$-moonflower if each set $S_i$ contains at least one element that is absent from all the others. We study the extremal problem of determining the largest possible size of a family of sets of size ... more >>>




ISSN 1433-8092 | Imprint