Monthly Archives: May 2019

Pseudorandom clique-free graphs

Pseudorandom graphs are graphs that in some way behaves like a random graph with the same edge density. One way in which this happens is as follows. In the random graph , with , a direct application of Chernoff bound … Continue reading

Posted in Combinatorics, Extremal Combinatorics, Spectral Graph Theory | Tagged , , | 5 Comments