Fifty years ago, several mathematicians at a dinner party were discussing graphs (points and lines, not chart graphs), and the generalization if you make the edges connecting a point (vertex) with another, able to connect multiple points. While working out the minimal number of colors in general, they found it to be an interesting problem, to test out and prove the next day… Well, that solution, to Erdős, Faber, and Lovász’ problem was delayed for years and years!

Continue reading “Mathematicians submit proof of Erdős Coloring Conjecture”