A Quasi Ramsey Theorem

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

Chapter Chapter 10 in Ramsey Theory for Discrete Structures, 2013, pp 111-118 from Springer

Abstract: Abstract The basic problem of (combinatorial) discrepancy theory Discrepancy theory Combinatorial discrepancy theory is how to color a set with two colors as uniformly as possible with respect to a given family of subsets. The aim is to achieve that each of the two colors meets each subset under consideration in approximately the same number of elements. From the finite Ramsey theorem (cf. Corollary 7.2) we know already that if the set of all 2-subsets of n is 2-colored, and the family of all ℓ-subsets for some $$\ell

Keywords: Finite Ramsey Theorem; Graph Case; Pairwise Disjoint Subsets; Chazelle; Lower Bound (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_10

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

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

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