Abstract
In this paper, we prove that every graph with average degree at least has a vertex partition into two parts, such that one part has average degree at least , and the other part has average degree at least . This solves a conjecture of Csóka, Lo, Norin, Wu and Yepremyan.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.