1 paper · 1 filter
Hao Lin, Guanghui Wang, Wenling Zhou
A k-graph (or k-uniform hypergraph) H is uniformly dense if the edge distribution of H is uniformly dense with respect to every large collection of k-vertex cliques induc…