Spectrum preserving short cycle removal on regular graphs

We describe a new method to remove short cycles on regular graphs while maintaining spectral bounds (the nontrivial eigenvalues of the adjacency matrix), as long as the graphs have certain combinatorial properties. These combinatorial properties are related to the number and distance between short cycles and are known to happen with high probability in uniformly random regular graphs. Using this method we can show two results involving high girth spectral expander graphs. First, we show that given $d \geq 3$ and $n$, there exists an explicit distribution of $d$-regular $Θ(n)$-vertex graphs where with high probability its samples have girth $Ω(\log_{d - 1} n)$ and are $ε$-near-Ramanujan; i.e., its eigenvalues are bounded in magnitude by $2\sqrt{d - 1} + ε$ (excluding the single trivial eigenvalue of $d$). Then, for every constant $d \geq 3$ and $ε> 0$, we give a deterministic poly$(n)$-time algorithm that outputs a $d$-regular graph on $Θ(n)$-vertices that is $ε$-near-Ramanujan and has girth $Ω(\sqrt{\log n})$, based on the work of arXiv:1909.06988 .