A theorem for coloring a large class of “perfect” mathematical networks could ease the way for a long-sought general coloring proof. Four years ago, the mathematician Maria Chudnovsky faced an all-too ...

This article was published in Scientific American’s former blog network and reflects the views of the author, not necessarily those of Scientific American Happy birthday to us! Kevin Knudson and I ...