A Survey of Hypergraph Ramsey Problems

Dhruv Mubayi () and Andrew Suk ()
Additional contact information
Dhruv Mubayi: University of Illinois
Andrew Suk: University of California at San Diego

A chapter in Discrete Mathematics and Applications, 2020, pp 405-428 from Springer

Abstract: Abstract The classical hypergraph Ramsey number r k(s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1, …, N}, there are s integers such that every k-tuple among them is red, or n integers such that every k-tuple among them is blue. We survey a variety of problems and results in hypergraph Ramsey theory that have grown out of understanding the quantitative aspects of r k(s, n). Our focus is on recent developments and open problems.

Date: 2020
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:spochp:978-3-030-55857-4_16

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

DOI: 10.1007/978-3-030-55857-4_16

Access Statistics for this chapter

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