Occasionally, other numbers have interesting properties: 1. No closed form solution for polynomials of degree 5 or larger. 2. 4-color theorem for painting pla

Occasionally, other numbers have interesting properties: 1. No closed form solution for polynomials of degree 5 or larger. 2. 4-color theorem for painting planar graphs. There are lots more counter-examples: not 0, not 1 and probably not infinite. Probably some other number of counter-examples. If you were making a paint the map algorithm - your data structure should assume you need 0, 1 or infinite colors, instead of no more than 4? Is that the point of the principle?