9 citations · 16 across the 21 of their papers we have counts for
1 paper · 1 filter
Dániel Korándi, Yuval Peled, Benny Sudakov
Given a random 3-uniform hypergraph H=H(n,p) on n vertices where each triple independently appears with probability p, consider the following graph process. We start with the…