Abstract
In this paper we give a new proof of the Nešetřil–Rödl Theorem, a deep result of discrete mathematics which is one of the cornerstones of the structural Ramsey theory. In contrast to the well-known proofs which employ intricate combinatorial strategies, this proof is spelled out in the language of category theory and the main result follows by applying several simple categorical constructions. The gain from the approach we present here is that, instead of giving the proof in the form of a large combinatorial construction, we can start from a few building blocks and then combine them into the final proof using general principles.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abramson, F.G., Harrington, L.A.: Models without indiscernibles. J. Symb. Log. 43, 572–600 (1978)
Adamek, J., Herrlich, H., Strecker, G.E.: Abstract and Concrete Categories: The Joy of Cats. Dover Books on Mathematics, Dover Publications, New York (2009)
Graham, R.L., Rothschild, B.L.: Ramsey’s theorem for n-parameter sets. Trans. Am. Math. Soc. 159, 257–292 (1971)
Hales, A.W., Jewett, R.I.: Regularity and positional games. Trans. Am. Math. Soc. 106, 222–229 (1963)
Hubička, J., Nešetřil, J.: All Those Ramsey Classes (Ramsey Classes with Closures and Forbidden Homomorphisms). Preprint arXiv:1606.07979v1
Mašulović, D., Scow, L.: Categorical equivalence and the Ramsey property for finite powers of a primal algebra. Algebra Univers. (to appear)
Mašulović, D.: Pre-Adjunctions and the Ramsey Property. Preprint arXiv:1609.06832
Mašulović, D.: A Dual Ramsey Theorem for Permutations. Preprint arXiv:1702.06596
Nešetřil, J.: Ramsey theory. In: Graham, R.L., Grötschel, M., Lovász, L. (eds.) Handbook of Combinatorics, vol. 2, pp. 1331–1403. MIT Press, Cambridge, MA (1995)
Nešetřil, J., Rödl, V.: Partitions of finite relational and set systems. J. Comb. Theory Ser. A 22, 289–312 (1977)
Nešetřil, J., Rödl, V.: Ramsey classes of set systems. J. Comb. Theory A 34, 183–201 (1983)
Nešetřil, J., Rödl, V.: The partite construction and Ramsey set systems. Discrete Math. 75, 327–334 (1989)
Prömel, H.J.: Induced partition properties of combinatorial cubes. J. Comb. Theory A 39, 177–208 (1985)
Sokić, M.: Ramsey properties of finite posets II. Order 29, 31–47 (2012)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Thomas Streicher.
Rights and permissions
About this article
Cite this article
Mašulović, D. A New Proof of the Nešetřil–Rödl Theorem. Appl Categor Struct 26, 401–412 (2018). https://doi.org/10.1007/s10485-017-9500-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10485-017-9500-4