Almost regular subgraphs under spectral radius constrains

Weilun Xu, Guorong Gao, An Chang

A graph is called $K$-almost regular if its maximum degree is at most $K$ times the minimum degree. Erdős and Simonovits showed that for a constant $0<\epsilon <1$ and a suffic…