Moonflowers are introduced as set families with per-set unique elements, yielding near-optimal extremal bounds that enable logarithmic code sparsification with a matching lower bound.
Mathematische Annalen , year =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Moonflowers and efficient code sparsification
Moonflowers are introduced as set families with per-set unique elements, yielding near-optimal extremal bounds that enable logarithmic code sparsification with a matching lower bound.