Sparse Ramsey Theorems

Hans Jürgen Prömel
Additional contact information
Hans Jürgen Prömel: Technische Universität Darmstadt

Chapter Chapter 16 in Ramsey Theory for Discrete Structures, 2013, pp 185-199 from Springer

Abstract: Abstract Sparse Ramsey theorems for graphs originated with investigations of graphs having large chromatic number and high girth (where the girth of a graph is the length of the smallest cycle in G). Note that this can be viewed as a special kind of restricted graph Ramsey problem.

Keywords: Large Chromatic Number; High Girth; Hales-Jewett Theorem; Sparse Version; Hypergraph (search for similar items in EconPapers)
Date: 2013
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-3-319-01315-2_16

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

DOI: 10.1007/978-3-319-01315-2_16

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