Koolen–Gebremichel conjecture on primitive strongly regular graphs with smallest eigenvalue −3
Let be a primitive strongly regular graph with parameters and smallest eigenvalue .
Koolen–Gebremichel conjecture. Either or .
The conjecture concerns the remaining feasible parameter sets for primitive strongly regular graphs with smallest eigenvalue . The paper establishes nonexistence for the parameters , but the broader conjecture remains open.
References
Primary source
Jack H. Koolen and Brhane Gebremichel, “There does not exist a strongly regular graph with parameters (1911,270,105,27)”, arXiv:2109.04000 (2021).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.