Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Twenty years of Nešetřil's classification programme of Ramsey classes

Jan Hubička, Matěj Konečný

TL;DR

This survey traces Nešetřil’s Ramsey-class classification program from its Ramsey-arrow roots in the 1970s to the modern synthesis with Fraïssé theory and topological dynamics. It explains how precompact Ramsey expansions, the expansion property, and the KPT correspondence connect combinatorial Ramsey classes to dynamical properties of automorphism groups, while detailing the partite construction and its extensions. The 2010s and 2020s broaden the program via systematic approaches for languages with functions, EPPA classifications, and big Ramsey structures, highlighting both triumphs and counterexamples. The work also catalogues open problems across Ramsey classes, EPPA, and big Ramsey degrees, pointing toward a unified framework and further cross-disciplinary applications. $\,$

Abstract

In the 1970s, structural Ramsey theory emerged as a new branch of combinatorics. This development came with the isolation of the concepts of the $\mathbf{A}$-Ramsey property and Ramsey class. Following the influential Nešetřil-Rödl theorem, several Ramsey classes have been identified. In the 1980s, Nešetřil, inspired by a seminar of Lachlan, discovered a crucial connection between Ramsey classes and Fraïssé classes, and, in his 1989 paper, connected the classification programme of homogeneous structures to structural Ramsey theory. In 2005, Kechris, Pestov, and Todorčević revitalized the field by connecting Ramsey classes to topological dynamics. This breakthrough motivated Nešetřil to propose a program for classifying Ramsey classes. We review the progress made on this program in the past two decades, list open problems, and discuss recent extensions to new areas, namely the extension property for partial automorphisms (EPPA), and big Ramsey structures.

Twenty years of Nešetřil's classification programme of Ramsey classes

TL;DR

This survey traces Nešetřil’s Ramsey-class classification program from its Ramsey-arrow roots in the 1970s to the modern synthesis with Fraïssé theory and topological dynamics. It explains how precompact Ramsey expansions, the expansion property, and the KPT correspondence connect combinatorial Ramsey classes to dynamical properties of automorphism groups, while detailing the partite construction and its extensions. The 2010s and 2020s broaden the program via systematic approaches for languages with functions, EPPA classifications, and big Ramsey structures, highlighting both triumphs and counterexamples. The work also catalogues open problems across Ramsey classes, EPPA, and big Ramsey degrees, pointing toward a unified framework and further cross-disciplinary applications.

Abstract

In the 1970s, structural Ramsey theory emerged as a new branch of combinatorics. This development came with the isolation of the concepts of the -Ramsey property and Ramsey class. Following the influential Nešetřil-Rödl theorem, several Ramsey classes have been identified. In the 1980s, Nešetřil, inspired by a seminar of Lachlan, discovered a crucial connection between Ramsey classes and Fraïssé classes, and, in his 1989 paper, connected the classification programme of homogeneous structures to structural Ramsey theory. In 2005, Kechris, Pestov, and Todorčević revitalized the field by connecting Ramsey classes to topological dynamics. This breakthrough motivated Nešetřil to propose a program for classifying Ramsey classes. We review the progress made on this program in the past two decades, list open problems, and discuss recent extensions to new areas, namely the extension property for partial automorphisms (EPPA), and big Ramsey structures.

Paper Structure

This paper contains 53 sections, 53 theorems, 23 equations, 11 figures.

Table of Contents

  1. Introduction
  2. Note
  3. 1970s: From Ramsey theorem to its structural forms
  4. Structural partition arrow
  5. Induced Ramsey theorems: colouring vertices or edges
  6. Nešetřil--Rödl and Abramson--Harrington theorems
  7. Ordering property
  8. 1980s: Seeking additional Ramsey classes
  9. Observation from Lachlan's seminar
  10. Ramsey classes from homogeneous graphs
  11. 1990s: Siesta time
  12. Classification Programme of Homogeneous Structures
  13. 2000s: The revitalization
  14. Nešetřil's classification programme of Ramsey classes
  15. Precompact expansions and the expansion property
  16. ...and 38 more sections

Key Result

Theorem 2.1

Figures (11)

  • Figure 1: An amalgam of $\mathbf {B}_1$ and $\mathbf {B}_2$ over $\mathbf {A}$.
  • Figure 2: An illustration of the proof of Observation \ref{['obs:ramseyamalg']}. Copies of $\mathbf {A}$ from $\mathbf {B}_1$ are coloured black, copies of $\mathbf {A}$ from $\mathbf {B}_2$ are coloured white.
  • Figure 3: Bowtie graph.
  • Figure 4: Construction of Ramsey objects as $\langle \mathbf {A},\mathbf {B},\mathbf {C} \rangle$-hypergraphs.
  • Figure 5: Some participants of the Ramsey DocCourse photographed at the world famous Seidel's studio in Český Krumlov: Eng Keat Hng, Jaroslav Nešetřil, David Bradley-Williams, Frank Ramsey, Jan Hubička, and Miltiadis Karamanlis in the back, Andrés Aranda and Micheal Pawliuk at the front. The second author, being a young undergraduate, had no finances to travel to the photo studio.
  • ...and 6 more figures

Theorems & Definitions (139)

  • Theorem 2.1: Finite Ramsey Theorem, 1930 Ramsey1930
  • Remark 2.2
  • Remark 2.3
  • Theorem 2.4: Nešetřil--Rödl, 1975 nevsetril1975ramsey
  • proof
  • Theorem 2.6: Nešetřil--Rödl, 1976 Nevsetvril1976
  • Theorem 2.7: Unrestricted Nešetřil--Rödl Theorem Nevsetvril1977 or Abramson--Harrington Theorem Abramson1978
  • Definition 2.8: Ramsey Class
  • Theorem 2.9: Nešetřil--Rödl Theorem Nevsetvril1977nevsetvril1977partitionsNevsetvril1983
  • Definition 2.10: Ordering Property nevsetril1975typeNesetvril1978
  • ...and 129 more