Abstract
Suppose that a strongly regular graph Γ with parameters (v, k, λ, μ) has eigenvalues k, r, and s. If the graphs Γ and \(\bar \Gamma \) are connected, then the following inequalities, known as Krein’s conditions, hold: (i) (r + 1)(k + r + 2rs) ≤ (k + r)(s + 1)2 and (ii) (s + 1)(k + s + 2rs) ≤ (k + s)(r + 1)2. We say that Γ is a Krein graph if one of Krein’s conditions (i) and (ii) is an equality for this graph. A triangle-free Krein graph has parameters ((r 2 + 3r)2, r 3 + 3r 2 + r, 0, r 2 + r). We denote such a graph by Kre(r). It is known that, in the cases r = 1 and r = 2, the graphs Kre(r) exist and are unique; these are the Clebsch and Higman–Sims graphs, respectively. The latter was constructed in 1968 together with the Higman–Sims sporadic simple group. A.L. Gavrilyuk and A.A. Makhnev have proved that the graph Kre(3) does not exist. In this paper, it is proved that the graph Kre(4) (a strongly regular graph with parameters (784, 116, 0, 20)) does not exist either.
Similar content being viewed by others
References
P. Cameron and J. van Lint, Designs, Graphs, Codes and their Links (Cambridge Univ. Press, Cambridge, 1981).
V. V. Bitkina, A. K. Gutnova, and A. A. Makhnev, Vladikav. Mat. Zh. 17 (2), 5–11 (2015).
V. V. Bitkina and A. A. Makhnev, in International Conference on Group Theory, Krasnoyarsk, Russia, 2016 (Krasnoyarsk, 2016), pp. 42–44.
A. L. Gavrilyuk and A. A. Makhnev, Dokl. Math. 72 (1), 591–594 (2005).
A. A. Makhnev, Dokl. Math. 83 (3), 340–343 (2011).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.A. Makhnev, 2017, published in Doklady Akademii Nauk, 2017, Vol. 475, No. 3, pp. 251–253.
Rights and permissions
About this article
Cite this article
Makhnev, A.A. The graph Kre(4) does not exist. Dokl. Math. 96, 348–350 (2017). https://doi.org/10.1134/S1064562417040123
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064562417040123