Conjecture on large co-edge-regular graphs with four eigenvalues
Let be a connected co-edge-regular graph with four distinct eigenvalues. Let be an integer and write . An -clique extension is a graph obtained from a graph by replacing each vertex with a clique of size , with adjacency between cliques determined by adjacency of the corresponding original vertices. Large co-edge-regular graph conjecture. There exists a constant such that, if
then is the -clique extension of a strongly regular graph for some integer satisfying . This predicts a structural classification of sufficiently large connected co-edge-regular graphs in this spectral range; the source presents it as a belief motivated by the study of regular graphs with four distinct eigenvalues and gives no resolution.
References
- Sakander Hayat, Jack H. Koolen and Muhammad Riaz, “A spectral characterization of the s-clique extension of the square grid graphs”, arXiv:1806.03593 (2018).
Progress summary
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.