Math educators walking through the enormous exhibit hall last week at the National Council of Teachers of Mathematics meeting in Denver couldn’t help but notice a “common” theme.

A theorem for coloring a large class of “perfect” mathematical networks could ease the way for a long-sought general coloring proof.