1 paper
Laihao Ding, Ander Lamaison, Hong Liu +2
For a k-uniform hypergraph (or simply k-graph) F, the codegree Turán density πco(F) is the supremum over all α such that there exist arbitrarily large n-ver…