Tag Archives: homogeneous

History of the Random Graph

Posted on 04/08/2015 by Peter Cameron

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

Posted on 19/06/2014 by Peter Cameron

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

Permutation groups and regular semigroups, 2

Posted on 06/04/2012 by Peter Cameron

João Araújo and I have been working together this week, and the paper, which I discussed here, is nearly ready to submit, after we managed a couple of quite significant improvements. I’d like to draw attention to a couple of … Continue reading →

Posted in mathematics, open problems | Tagged , , , , , | 7 Comments