.png){kind=icon}
.png){kind=icon}
Return
Separating hypergraph Turán densities
.png){kind=icon}
PRE
AI
DOI：10.1112/blms.70195.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Determining the Tur & aacute;n densities of hypergraphs is a notoriously difficult problem at the core of combinatorics. Although Tur & aacute;n posed this problem in 1941, the value of remains unknown for all . Prior to this work, it was not even known whether holds for general and , and the best-known bounds on are far from implying anything close to this. We prove that , for all , and provide general criteria to distinguish the Tur & aacute;n densities of two hypergraphs. As a corollary, we also obtain that , for all . For , this was previously proved by Markstr & ouml;m, answering a question by Erd & odblac;s.
Keywords:
TURAN-DENSITIES
Journal
B
IF:
0.9
Papers:
193
Citations:
0