Indexed metadata
Improved Sidorenko bound for hypergraph Turan densities
Shuyan Chen, Xinmin Hou, Xizhi Liu
Source abstract
For every fixed integer , we prove that the Turán density of every -uniform hypergraph with edges satisfies , where depends only on . This improves Sidorenko's general bound, whose gap from is of order . Complete -uniform hypergraphs show that the exponent is optimal. The proof combines a potential argument for partial embeddings with the Lovász Local Lemma.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.