Edge-Colored Graphs: Ramsey and Folkman Numbers

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

Chapter Chapter 29 in The New Mathematical Coloring Book, 2024, pp 289-311 from Springer

Abstract: Abstract In this chapter, we will see that no matter how edges of a complete graph Kn are colored in two or, more generally, finitely many colors (each edge in one color), we can guarantee the existence of the desired monochromatic subgraph as long as we choose n to be large enough.

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_29

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

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

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