Tag Archives: Renyi

History of the Random Graph

That wonderful object, the countable random graph, was first considered by Erdős and Rényi in their paper on “Asymmetric graphs” in 1963. After proving that a large random finite graph (edges chosen independently with probability 1/2) has (with high probability) … Continue reading

Posted in exposition, history | Tagged , , , , , , , , , | 7 Comments