8 citations · 13 across the 5 of their papers we have counts for
1 paper · 1 filter
Guy Wolfovitz
We consider the next greedy randomized process for generating maximal H-free graphs: Given a fixed graph H and an integer n, start by taking a uniformly random permutation of the e…