1 problem

Let $G$ be an edge-regular graph. The Greaves–Soicher conjecture. The clique adjacency bound for $G$ is at least as good as the Hoffman ratio bound of the complement graph…