Embedding World Series

During December 1991–January 1992, Paul Erdős and I were working on the book Problems of pgom Erdős at my home in Colorado Springs. Ron Graham called and invited me to meet him in person at a Florida Atlantic University’s conference, which I did not know existed. I had just started publishing the problem-posing quarterly Geombinatorics, and, at that conference, I introduced it to my colleagues for the first time while giving a talk on the chromatic number of the plane problem. As a result, a group of brilliant young PhD students, including Paul O’Donnell and Rob Hochberg, got excited about the problem and the new journal. Geombinatorics has become the main home for related problems and results, outshining, in this regard, top journals on combinatorial theory and discrete geometry. One of the most exciting consequences was the competition for the smallest unit distance triangle-free graph, which I named Embedding World Series.