Hypergraphs Reveal a Solution to a 50-Year-Old Problem
by Leila Sloman from on (#620CP)
In 1973, Paul Erds asked if it was possible to assemble sets of triples"-three points on a graph-so that they abide by two seemingly incompatible rules.In 1973, Paul Erds asked if it was possible to assemble sets of triples"-three points on a graph-so that they abide by two seemingly incompatible rules.