Abstract:In this paper, we prove that every graph with average degree at least s + t + 2 has a vertex partition into two parts, such that one part has average degree at least s, and the other part has average degree at least t. This solves a conjecture of Csóka, Lo, Norin, Wu and Yepremyan.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.