Graph Partitions Under Average Degree Constraint
Combinatorics
2022-02-17 v1
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\'{o}ka, Lo, Norin, Wu and Yepremyan.
Cite
@article{arxiv.2202.08123,
title = {Graph Partitions Under Average Degree Constraint},
author = {Yan Wang and Hehui Wu},
journal= {arXiv preprint arXiv:2202.08123},
year = {2022}
}