Metraipolis › archive › dc_316607bddeb3
Polynomial-in-$r$ bounds for forbidden traces of uniform hypergraphs — arXiv:2610.08151
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.08151
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:53:18.022Z
- SHA-256 of the archived text
7d70a648d6e4f67a5460b75b56053e555d35985378a491db0e3482e6b22dd163- Stable URL of this page
https://metraipolis.com/documento/dc_316607bddeb3
How to cite
Polynomial-in-$r$ bounds for forbidden traces of uniform hypergraphs — arXiv:2610.08151 — arXiv (en), https://arxiv.org/abs/2610.08151 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_316607bddeb3 (Metraipolis archive dc_316607bddeb3, sha256 7d70a648d6e4f67a5460b75b56053e555d35985378a491db0e3482e6b22dd163)
BibTeX
@misc{dc316607bddeb3,
title = {Polynomial-in-$r$ bounds for forbidden traces of uniform hypergraphs — arXiv:2610.08151},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.08151},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_316607bddeb3; sha256 7d70a648d6e4f67a5460b75b56053e555d35985378a491db0e3482e6b22dd163},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.08151. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We give a general principle that converts fixed-uniformity bounds for forbidden traces into bounds with polynomial dependence on the uniformity. More precisely, let $H$ be a fixed set system on $h\ge1$ vertices, and suppose that, for some $\alpha\ge0$, $\operatorname{ex}_j(m,\operatorname{Tr}(H))=O_{H,j}(m^\alpha)$ for every fixed integer $j\ge1$. Then, for every $\varepsilon>0$, there is a constant $C_{H,\alpha,\varepsilon}$ such that \[ \operatorname{ex}_r(m,\operatorname{Tr}(H)) \le C_{H,\alpha,\varepsilon} r^{h-1-\alpha+\varepsilon}m^\alpha \] for all $m\ge r\ge2$. In particular, for trace-$C_4$-free hypergraphs and every $\varepsilon>0$ there is a constant $C_\varepsilon$ such that \[ \operatorname{ex}_r(m,\operatorname{Tr}(C_4)) \le C_\varepsilon r^{3/2+\varepsilon}m^{3/2} \] for all $m\ge r\ge2$. We also construct trace-$C_4$-free $r$-graphs showing that \[ \operatorname{ex}_r(m,\operatorname{Tr}(C_4)) \ge c r^{1/2}m^{3/2} \] for an absolute constant $c>0$, for every fixed $r\ge3$ and all sufficiently large $m$ (depending on $r$).
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.08151 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T11:22:09.561Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).