### Top Posts

### Recent comments

- Asghar Moeini on The Traveling Salesman Problem: An Optimization Model
- Peter Cameron on Beginning a career
- Josh Paik on Beginning a career
- David Roberts on Combinatorial Theory
- Rick Thomas on The Fitting subgroup

### Blogroll

- Alexander Konovalov
- Annoying precision
- Astronomy Picture of the Day
- Azimuth
- Bad science
- Bob Walters
- British Combinatorial Committee
- CIRCA tweets digest
- CoDiMa
- Coffee, love, and matrix algebra
- Collecting reality
- Comfortably numbered
- Computational semigroup theory
- DC's Improbable Science
- Diamond Geezer
- Exploring East London
- From hill to sea
- Gödel's lost letter and P=NP
- Gil Kalai
- Haris Aziz
- Intersections
- Jane's London
- Jon Awbrey
- Kourovka Notebook
- LMS blogs page
- Log24
- London Algebra Colloquium
- London Reconnections
- Marie Cameron's blog
- MathBlogging
- Micromath
- Neill Cameron
- neverendingbooks
- Noncommutative geometry
- numericana hall of fame
- Paul Goldberg
- Ratio bound
- Robert A. Wilson's blog
- Sheila's blog
- Since it is not …
- Spitalfields life
- St Albans midweek lunch
- Stubborn mule
- Sylvy's mathsy blog
- SymOmega
- Tangential thoughts
- Terry Tao
- The Aperiodical
- The De Morgan Journal
- The ICA
- The London column
- The Lumber Room
- The matroid union
- Theorem of the day
- Tim Gowers
- Vynmath
- XKCD

### Find me on the web

### Cameron Counts: RSS feeds

### Meta

# Tag Archives: homogeneous

## 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 back-and-forth, Cantor, Erdos, Fraisse, homogeneous, Huntington, Rado, Renyi, universal, Urysohn
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 generic, Henson's graph, homogeneous, multiorders, orders, Petrov-Vershik measure, random graph, universal
1 Comment

## Permutation groups and regular semigroups, 2

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 homogeneous, Livingstone, regular semigroups, set-transitive, universal transversal property, Wagner
7 Comments