On Krein graphs without triangles (Q2455230)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5202999
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Krein graphs without triangles |
scientific article; zbMATH DE number 5202999 |
Statements
On Krein graphs without triangles (English)
0 references
22 October 2007
0 references
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.
0 references
strongly regular graph
0 references
Krein graph
0 references
0.8756834864616394
0 references
0.8164674043655396
0 references
0.7632928490638733
0 references
0.7476298213005066
0 references
0.7456358671188354
0 references