1 citations · 1 across the 6 of their papers we have counts for
1 paper · 1 filter
Daniel Altman, Catherine Greenhill, Mikhail Isaev +1
Let G(n,r,s) denote a uniformly random r-regular s-uniform hypergraph on n vertices, where s is a fixed constant and r=r(n) may grow with n. An ℓ-overl…