Search arXivSearch

arXiv · 2501.17293

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

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jan Hubička, Matěj Konečný. 2025-10-31. Twenty years of Nešetřil's classification programme of Ramsey classes. https://doi.org/10.1016/j.cosrev.2025.100814

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO