Chapter 4.2, Problem 28MS

Greater than. You’ve triangulated your polygon and assigned a color (red, blue, or yellow) to each vertex so that each triangle has all three colors appearing. Let r equal the number of red vertices, b equal the number of blue vertices, and y equal the number of yellow vertices. If $\text{r > 6, b > 7, and y > 10,}$ what’s the smallest number of vertices the polygon can have?