Comparison of two techniques for proving nonexistence of strongly regular graphs

Built on

R. Baer, Polarities in finite projective planes, Bull. Amer. Math. Soc
1946
Earlier work this paper cites.
W.S. Connor and W.H. Clatworthy, Some theorems for partially balanced designs, Ann. Math. Stat
1954
Earlier work this paper cites.
A.J. Hoffman and R.R. Singleton, On Moore graphs with diameters 2 2 and 3 3 , IBM J. Res. Develop
1960
Earlier work this paper cites.
R.C. Bose, Strongly regular graphs, partial geometries and partially balanced designs, Pacific J. Math
1963
Earlier work this paper cites.

P. Erdős, A. Rényi, and V.T. Sós, On a problem of graph theory, Studia Sci.Math. Hungar
1966
Cited alongside, same era.
H.S. Wilf, The friendship theorem, in: Combinatorial Mathematics and its Applications (D.J.A. Welsh, ed.)
1971
Cited alongside, same era.
J.Q. Longyear and T.D. Parsons, The friendship theorem, Indagationes Mathematicae
1972
Cited alongside, same era.

A.E. Brouwer and J.H. van Lint, Strongly regular graphs and partial geometries, in: Enumeration and design (D.M. Jackson and S.A. Vanstone, eds.)
1984
Later among the works it cites.
C. Huneke, The Friendship Theorem, Amer. Math. Monthly
2002
Later among the works it cites.
P.J. Cameron, Strongly regular graphs, in: Topics in algebraic graph theory (L.W. Beineke and R.J. Wilson, eds
2004
Later among the works it cites.