### Top Posts

### Recent comments

- Ofir Gorodetsky on A little problem
- Ofir Gorodetsky on A little problem
- gorodetsky on A new constant?
- Ofir Gorodetsky on A little problem
- Peter Cameron on Andrzej Orchel

### 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: Shrikhande graph

## S. S. Shrikhande

News reached me today of the death of S. S. Shrikhande, at the age of 102. I have written about him before; in particular, here, I discussed two things for which he was perhaps best known, which can bear repeating. … Continue reading

## Shrikhande 100

Professor S. S. Shrikhande is 100. I offer him my warmest congratulations and birthday greetings. Among much else in his distinguished career, he was one of the three who showed that a pair of orthogonal Latin squares exists for every … Continue reading

Posted in events, exposition, history
Tagged Euler spoilers, orthogonal Latin squares, Shrikhande graph
Leave a comment

## A Shrikhande challenge

I discussed here the problem of covering the m-fold complete graph on n vertices with copies of a given graph G. The smallest strongly regular graph for which I don’t know the answer is the Shrikhande graph. I can copy … Continue reading