3 citations · 3 across the 4 of their papers we have counts for
1 paper · 2 filters
Michael Krivelevich, Benny Sudakov
Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject…