Solution of an Erdős Problem: The O’Donnell Theorem

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

Chapter Chapter 50 in The New Mathematical Coloring Book, 2024, pp 651-654 from Springer

Abstract: Abstract In a surprising twist, the complete solution of Paul Erdős’ old July 1975 problem about unit distance 4-chromatic graphs of arbitrary girth comes out to be simpler than all partial solutions, we have discussed in the previous two chapters. In another surprise, Paul O’Donnell uses in his solution the 1966 result obtained jointly by Paul Erdős and Andras Hajnal, the result that has been known all alone, but no one noticed its connection to the problem at hand. You may wish to revisit definitions of uniform hypergraphs in the beginning of Chap. 48 .

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_50

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

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

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 ().