### Top Posts

### Recent comments

- Ian on The symmetric group, 3
- 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

### 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: strongly regular graph

## There is no McLaughlin geometry

Congratulations to Patric Östergård and Leonard Soicher, who have just completed a big computation whose conclusion is “There is no McLaughlin geometry”. The run-time of the computation was about 250 core-years. So what did they compute, and why does it … Continue reading

## Symmetry versus regularity

In my report on CAMconf, I didn’t mention Laci Babai’s talk, whose title was the same as that of this post. This was a talk that needed some thinking about. I want to describe the situation briefly, and then pose … Continue reading

Posted in events, exposition, open problems
Tagged primitive group, Seidel switching, Steiner system, strongly regular graph, switching class
4 Comments

## The prehistory of the Higman-Sims graph

Triangle-free strongly regular graphs form a fascinating byway of combinatorics. These are regular graphs of valency k on v vertices, which contain no triangles, and have the property that any two non-adjacent vertices have μ common neighbours. The numbers (v,k,μ) … Continue reading

Posted in exposition, history
Tagged Dale Mesner, Higman-Sims, strongly regular graph, triangle-free graph
1 Comment

## Team games, 3

Recall the general problem: Given n players, arrange a series of matches, each between two teams of k players, in such a way that every pair of players are on the same team in s matches and on opposite teams … Continue reading