Let G be a graph on n vertices. A 2-lift of G is a graph H on 2n vertices, with a covering map π : H → G. It is not hard to see that all eigenvalues of G are also eigenvalues of H. In addition, H has n “new” eigenvalues. We conjecture that every d-regular graph has a 2-lift such that all new eigenvalues are in the range [−2 √ d− 1, 2 √ d− 1] (If true, this is tight , e.g. by the Alon-Boppana bo...