.png){kind=icon}
.png){kind=icon}
Return
Hypergraphs with arbitrarily small codegree Turán density
.png){kind=icon}
PRE
AI
DOI：10.1112/blms.70348.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The codegree Tur & aacute;n density gamma(F) of a k-graph F is the smallest gamma is an element of [0, 1) such that every k-graph H with delta(k-1)(H) >= (gamma + o(1))|V(H)| contains a copy of F. In this work, we show that for every epsilon>0, there is a k-uniform hypergraph F with 0 < gamma(F) < epsilon. The initial preprint of this work leads to significant subsequent research on accumulation points of variants of the Tur & aacute;n density
Journal
B
IF:
0.9
Papers:
193
Citations:
0