Applications of the Baudet–Schur–Van der Waerden

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

Chapter Chapter 48 in The New Mathematical Coloring Book, 2024, pp 643-646 from Springer

Abstract: Abstract At the end of Chap. 14 , I left you with the embedding in the plane of the 352,735-vertex Blanche Descartes graph by Paul O’Donnell. One may ask, would attaching longer k-cycles (k > 7) to the foundation vertices increase the graph’s girth while keeping the chromatic number at 4? The answer is no – not if k-cycles were attached to all k-element subsets of the foundation set – because some k-cycles would have two or more vertex intersection that could cut down the girth of the graph. We would get a chance to succeed at this construction if we were to dramatically limit the number of attached k-cycles, by, say, allowing at most a single point intersection for the k-subsets of the foundation, to which k-cycles are allowed to be attached. This is exactly what O’Donnell implemented.

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_48

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

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

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