Paragraph

So the question is, what is the largest chromatic number of any planar graph? The answer is the best known theorem of graph theory:

in-context