MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

From what I've read I've gathered the following facts:

  • There are seven known such graphs.
  • Certain parameter sets are ruled out by the Krein conditions and the absolute bound.
  • Beyond that, little or nothing is known.

Am I missing something? I have read Biggs's report which lists all small feasible parameter sets and apparently this paper shows that (324,57,0,12) is infeasible.

Is something else known about this problem?

share|cite|improve this question

The complete bipartite graphs $K_{n,n}$ are strongly regular and triangle-free. This nitpicking aside, your summary is accurate.

share|cite|improve this answer
In fact, 20 years ago (almost) Chris published his "Problems in Algebraic Combinatorics" in a very early volume of the Electronic Journal of Combinatorics asking among other things, "Is there an eighth triangle-free SRG?" the answer to which is still unknown. – Gordon Royle Sep 11 '13 at 8:55

an update of Biggs's list (complete up to 1300 vertices) is maintained here by Andries Brouwer.

for a list of open problems and research directions, a good starting point could be Matan Ziv-Av's recent presentations 2011 --- 2013 and conference paper.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.