Hamming graph distinct-eigenvalue conjecture
Let be the Hamming scheme on , where is a set of size , and let be its distance- graph.
Hamming distinct-eigenvalue conjecture. If is connected, it has more than distinct eigenvalues.
The paper explicitly states that this conjecture remains open.
References
- Sebastian M. Cioabă and Himanshu Gupta, “On the eigenvalues of Grassmann graphs, Bilinear forms graphs and Hermitian forms graphs”, arXiv:2102.10155 (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.