I’m working on a discrete math question and need an explanation to help me study.Use graph theory. You have exactly 16 balls. There are 4 red, 4 blue, 4 green, and 4 black. You are allowed
to distribute the balls into 4 different buckets, in any way you want. Each bucket can hold a maximum of 5 balls.
Show that no matter how you distribute the balls, it is always possible to select a different colored
ball from each bucket.