Koolen–Gebremichel conjecture on primitive strongly regular graphs with smallest eigenvalue −3

From papers

Let GG be a primitive strongly regular graph with parameters (n,k,λ,μ)(n,k,\lambda,\mu) and smallest eigenvalue 3-3.

Koolen–Gebremichel conjecture. Either μ{6,9}\mu\in\{6,9\} or n276n\leqslant 276.

The conjecture concerns the remaining feasible parameter sets for primitive strongly regular graphs with smallest eigenvalue 3-3. The paper establishes nonexistence for the parameters (1911,270,105,27)(1911,270,105,27), but the broader conjecture remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

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).

Solutions 0

No solutions have been posted yet.