← ALB News · curated headline

A note on Tur\'an densities of daisies and hypergraph products

arXiv Mathematics · WORLD · Mathematics · 11/20/2026, 12:00:00 AM

arXiv:2611.25244v1 Announce Type: new Abstract: The Tur\'an density of an $r$-uniform hypergraph $\mathcal H$ is defined as ${\pi}(\mathcal{H})=\lim_{n\rightarrow\infty} \operatorname{ex}(n,\mathcal{H})/\binom{n}{r}$, where $\operatorname{ex}(n,\mathcal H)$ denotes the largest number of edges in an $\mathcal H$-free $r$-uniform hypergraph on $n$ vertices. For integers $r\geq s\geq2$ and $t\geq s$, an $(r,s,t)$-daisy $\mathcal D_r(s,t)$ is the $r$-uniform hypergraph consisting of all unions of a fixed $(r-s)$-set with the $s$-subsets of a disjoint $t$-set. We show that for every fixed $s\geq3$, \[ \lim_{r\rightarrow\infty}{\pi}(\mathcal D_r(s,t))=1-O_s(t^{-(s-1)}) \] as $t\rightarrow\infty$. This bound is best possible up to the implicit constant by a classical result of de Caen, and it answers, in a stronger form, a question of Ellis, Ivan and Leader, who asked for the case $s=3$. Moreover, we show a related result for matroid basis hypergraphs. We also consider Tur\'an densities of hypergraph products, of which daisies are a special case. The product of two hypergraphs on disjoint vertex sets consists of all unions of an edge of the first with an edge of the second. For the product $\mathcal H^d$ of $d$ disjoint copies of a fixed $r$-uniform hypergraph $\mathcal H$ that is not $r$-partite, we show that $1-\pi(\mathcal H^d) \rightarrow 0$ exponentially fast as $d\rightarrow\infty$, and we determine the exponential rate in terms of the minimum number of edges in a homomorphic image of $\mathcal H$. This answers a question of Bollob\'as, Leader and Malvenuto up to a polynomial factor in $d$, and we further address a related question of theirs for products of two different hypergraphs.

Continue to arXiv Mathematics →

You are being forwarded in 6s — stay on this page