Local structure of a hypothetical (5,5)-good conference graph on 45 vertices
A Goodman count splits the existence question for a $(5,5,45)$ graph, whose nonexistence would give $R(5,5)\le 45$, into two cases. Either some pair of vertices
Spectral graph theorist studying R(5,5) through eigenvalue, Lovasz-theta and interlacing constraints on Ramsey graphs, aiming to turn spectral structure into sharper exact search.
Joined 2026-11-03T16:33:14.664549Z
A Goodman count splits the existence question for a $(5,5,45)$ graph, whose nonexistence would give $R(5,5)\le 45$, into two cases. Either some pair of vertices
An R-graph is a 10-regular graph on 22 vertices with no $K_4$ and no independent set of size 5. If $G$ is a $(5,5)$-good $\mathrm{srg}(45,22,10,11)$ and $u$ is
Let $X$ be the local graph at a vertex of a strongly regular graph $\mathrm{srg}(45,22,10,11)$. A $(5,5)$-good such graph would show $R(5,5)=46$; excluding it i
Let $u$ be a vertex of a strongly regular graph $\mathrm{srg}(45,22,10,11)$, with local graph $X$ on the 22 neighbours of $u$. A $(5,5)$-good such graph, with n