On Krein graphs without triangles
Concerning the existence of Krein graphs Kre(\(r\)), a lemma in [\textit{S. R. Zaripov, A. A. Makhnev} and \textit{I. P. Yablonko}, On strongly regular triangle-free graphs. In: Algebra and linear optimization. Proc. of the international seminar, dedicated to S. N. Chernikov on the occasion of his 90th birthday, Ekaterinburg, 117-121 (2002; Zbl 1009.20001)] involved an arithmetical error. In the present paper this error is corrected. The authors show that any Krein graph Kre(\(r\)) does not contain any subgraph \(K_{r,r}\) for \(r\geq 9\) and, by using a graph-theoretical argument, the nonexistence of Kre(3) (i.e., strongly regular graphs with parameters \((324,57,0,12)\)) is proved.
- The graph \(\operatorname{Kre}(4)\) does not exist
- Automorphisms of Strongly Regular Krein Graphs without Triangles
- Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
- There is no strongly regular graph with parameters (460, 153, 32, 60)
- Inverse problems in the class of distance-regular graphs of diameter 4
- Almost 2-homogeneous graphs and completely regular quadrangles
- The mathematics of Donald Gordon Higman
- On highly regular strongly regular graphs
- Inverse problems in the class of distance-regular graphs of diameter 4
- The graph \(\operatorname{Kre}(4)\) does not exist
- Critical graphs without triangles: an optimum density construction
- On automorphisms of distance-regular graphs
- More about sparse halves in triangle-free graphs
- Automorphisms of Strongly Regular Krein Graphs without Triangles
- Unions of a clique and a co-clique as star complements for non-main graph eigenvalues
- scientific article; zbMATH DE number 7068502 (Why is no real title available?)
- On graphs in which the neighborhoods of vertices are edge-regular graphs without 3-claws
This page was built for publication: On Krein graphs without triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2455230)
