Embedding World Series

Alexander Soifer
Additional contact information
Alexander Soifer: University of Colorado at Colorado Springs, College of Letters, Arts, and Sciences

Chapter Chapter 15 in The New Mathematical Coloring Book, 2024, pp 127-145 from Springer

Abstract: Abstract 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.

Date: 2024
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-0716-3597-1_15

Ordering information: This item can be ordered from
http://www.springer.com/9781071635971

DOI: 10.1007/978-1-0716-3597-1_15

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().