Tag Archives: Erdos

Sum-free sets

This semester, Han Yu has run a reading group on Arithmetic Combinatorics. Mostly we have been following the excellent notes by Tuomas Orponen. I gave two talks. The first was a proof of the result of Ellenberg and Gijswijt on … Continue reading

Posted in exposition | Tagged , , , , , , , , , | 2 Comments

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