Graph Partitions Under Average Degree Constraint
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\'oka, Lo, Norin, Wu and Yepremyan.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.