2 Review of Ramanujan and near-Ramanujan families

A deterministic poly(n)-time algorithm is given that outputs a d-regular graph on Θ(n) vertices that is ǫ-near-Ramanujan that is bounded in magnitude by 2 √ d − 1 + Ǭ (excluding the single trivial eigenvalue of d).