Quasi-Random Graphs
01 December 1989
Perhaps the simplest model of generating a 'random' graph G on n vertices is the process which considers each of the possible pairs {v,v} of vertices of G, and decides independently with probability 1/2 whether or not {v,v} is an edge.