

























Let $H_k^r$ denote an $r$-uniform hypergraph with $k$ edges and $r+1$ vertices, where $k \leq r+1$ (it is easy to see that such a hypergraph is unique up to isomorphism). The known general bounds on its Turán density are $π(H_k^r) \leq \frac{k-2}{r}$ for all $k \geq 3$, and $π(H_3^r) \geq 2^{1-r}$ for $k=3$. We prove that $π(H_k^r) \geq (C_k - o(1)) \, r^{-(1+\frac{1}{k-2})}$ as $r\to\infty$. In the case $k=3$, we prove $π(H_3^r) \geq (1.7215 - o(1)) \, r^{-2}$ as $r\to\infty$, and $π(H_3^r) \geq r^{-2}$ for all $r$.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。