# What is the state of the art on triangle-free strongly regular graphs?

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.

-

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

-
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.

-