Hypergraphs Reveal a Solution to a 50-Year-Old Problem

By Leila Sloman In 1973, Paul Erdős asked if it was possible to assemble sets of “triples”—three points on a graph—so that they abide by two seemingly incompatible rules.

Source:: Wired

Be the first to comment

Leave a Reply