### Top Posts

### Recent comments

### 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
- 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
- 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
- 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: Norman Biggs

## The Sylvester design

The Sylvester graph There is a distance-transitive graph on 36 vertices with valency 5 known as the Sylvester graph. The graph was first constructed by Norman Biggs and his co-authors in their work on small distance-transitive graphs. I asked Norman … Continue reading

## London Combinatorics Colloquia, 2

It’s that time of year again, and while I miss the buttercups in Reading, we had as usual a feast of interesting mathematics and a large and enthusiastic audience. It was a bit more tightly focussed than I would have … Continue reading

Posted in events, exposition
Tagged amenability, Ben Green, Cayley graphs, Endre Szemeredi, Gabor Kun, Noga Alon, Norman Biggs, Regularity Lemma, sum-free sets
Leave a comment