Eigenvalues of subgraphs of the cube

Authors

Béla Bollobás, Faculty of MathematicsFollow
Jonathan Lee, Microsoft ResearchFollow
Shoham Letzter, Faculty of Mathematics

Abstract

We consider the problem of maximising the largest eigenvalue of subgraphs of the hypercube Qd of a given order. We believe that in most cases, Hamming balls are maximisers, and our results support this belief. We show that the Hamming balls of radius o(d) have largest eigenvalue that is within 1+o(1) of the maximum value. We also prove that Hamming balls with fixed radius maximise the largest eigenvalue exactly, rather than asymptotically, when d is sufficiently large. Our proofs rely on the method of compressions.

Publication Title

European Journal of Combinatorics

Recommended Citation

Bollobás, B., Lee, J., & Letzter, S. (2018). Eigenvalues of subgraphs of the cube. European Journal of Combinatorics, 70, 125-148. https://doi.org/10.1016/j.ejc.2017.12.007