2 problems

Let $G=(V,E)$ be a connected graph and let ${\mathcal S}\subset V$ be an arbitrary set with $|{\mathcal S}|=m$. Let $0=\lambda_1\leq\cdots\leq\lambda_n$ be the eigenvalues of the n…

Consider the sampling algorithm in which bad edges are tracked using the modified definition described in the surrounding argument, and where multiple edges may remain after the re…