1 paper · 1 filter
Laihao Ding, Hong Liu, Shuaichao Wang +1
For a k-uniform hypergraph (or simply k-graph) F, the codegree Turán density πco(F) is the infimum over all α such that any n-vertex k-graph H with ever…