A New Proof of the Nešetřil-Rödl Theorem

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Masulovic, Dragan
Format: Preprint
Veröffentlicht: 2017
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866916069077155840
author Masulovic, Dragan
author_facet Masulovic, Dragan
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_1703_04685
institution arXiv
publishDate 2017
record_format arxiv
spellingShingle A New Proof of the Nešetřil-Rödl Theorem
Masulovic, Dragan
Category Theory
Combinatorics
18A10, 05C55
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.
title A New Proof of the Nešetřil-Rödl Theorem
topic Category Theory
Combinatorics
18A10, 05C55
url https://arxiv.org/abs/1703.04685