Tag Archives: universal

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

Almost highly transitive

I want to discuss a concept I have known about for quite a long time, but never found any real use for. Suggestions welcome! Highly transitive groups A permutation group is n-transitive if it has a single orbit on the … Continue reading

Posted in Uncategorized | Tagged , , , , , , , | 1 Comment