Definition
A spectral graph theory technique for proving bounds on sparsified graph structures.
A spectral construction associated with Batson, Spielman, and Srivastava for proving sparsification and related results in spectral graph theory; appears as one route an AI prover took on an Erdős-style problem.