Explicit near-Ramanujan graphs of every degree

Abstract

For every constant d ≥ 3 and " > 0, we give a deterministic poly(n)-time algorithm that outputs a d-regular graph on (n) vertices that is "-near-Ramanujan; i.e., its eigenvalues are bounded in magnitude by 2gd-1 + " (excluding the single trivial eigenvalue of d).