-2
$\begingroup$

I have a graph $G(V,E)$ where each vertex has degree at most $k$. How can I prove that I need at most $2k + 1$ disjoint sets of vertices in which there is no connection between two vertices from the same set to create the set of vertices $V$.

$\endgroup$

closed as off-topic by Namaste, Morgan Rodgers, Aqua, Misha Lavrov, Rolf Hoyer Nov 12 '17 at 14:20

This question appears to be off-topic. The users who voted to close gave this specific reason:

  • "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Namaste, Aqua, Misha Lavrov, Rolf Hoyer
If this question can be reworded to fit the rules in the help center, please edit the question.

2
$\begingroup$

It is well-known and easy to prove that if each vertex of a graph has degree at most $k$ then its vertices can be colored into $k+1$ colors in such a way that there are no adjacent monochromatic vertices. This yield a required partition even into $k+1$ sets of vertices.

$\endgroup$

Not the answer you're looking for? Browse other questions tagged or ask your own question.