A note on vertex partitions

2011/07/08 by Landon Rabern, Rabern, Landon
Mathematics · #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.1107.1735

openalex publication_date 2011/07/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We prove a general lemma about partitioning the vertex set of a graph into subgraphs of bounded degree. This lemma extends a sequence of results of Lovász, Catlin, Kostochka and Rabern.

Related

• Graph Partitions Under Average Degree Constraint
• Partitioning graphs with linear minimum degree
• Monochromatic bounded degree subgraph partitions
• Partitioning sparse graphs into an independent set and a graph with bounded size components
• Partitions of Graphs into Special Bipartite Graphs