English
Related papers

Related papers: Big Ramsey degrees using parameter spaces

200 papers

We prove an infinite Ramsey theorem for noncommutative graphs realized as unital self-adjoint subspaces of linear operators acting on an infinite dimensional Hilbert space. Specifically, we prove that if V is such a subspace, then provided…

Operator Algebras · Mathematics 2017-11-28 Matthew Kennedy , Taras Kolomatski , Daniel Spivak

Milliken's tree theorem is a deep result in combinatorics that generalizes a vast number of other results in the subject, most notably Ramsey's theorem and its many variants and consequences. Motivated by a question of Dobrinen, we initiate…

Size-Ramsey numbers are a central notion in combinatorics and have been widely studied since their introduction by Erd\H{o}s, Faudree, Rousseau and Schelp in 1978. Research has mainly focused on the size-Ramsey numbers of $n$-vertex graphs…

Combinatorics · Mathematics 2023-09-06 Nemanja Draganić , Marc Kaufmann , David Munhá Correia , Kalina Petrova , Raphael Steiner

Given a countably infinite hypergraph $\mathcal R$ and a finite hypergraph $\mathcal A$, the big Ramsey degree of $\mathcal A$ in $\mathcal R$ is the least number $L$ such that, for every finite $k$ and every $k$-colouring of the embeddings…

Combinatorics · Mathematics 2019-06-11 Martin Balko , David Chodounský , Jan Hubička , Matěj Konečný , Lluis Vena

In contrast to the abundance of "direct" Ramsey results for classes of finite structures (such as finite ordered graphs, finite ordered metric spaces and finite posets with a linear extension), in only a handful of cases we have a…

Combinatorics · Mathematics 2018-07-06 Dragan Mašulović , Bojana Pantić

Chv\'atal, R\"odl, Szemer\'edi and Trotter proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. We prove that the same holds for 3-uniform hypergraphs. The main new tool which we prove and use is an…

Combinatorics · Mathematics 2007-05-23 Oliver Cooley , Nikolaos Fountoulakis , Daniela Kühn , Deryk Osthus

The well-known Galvin-Prikry Theorem states that Borel subsets of the Baire space are Ramsey: Given any Borel subset $\mathcal{X}\subseteq [\omega]^{\omega}$, where $[\omega]^{\omega}$ is endowed with the metric topology, each infinite…

Combinatorics · Mathematics 2024-10-01 Natasha Dobrinen

We consider Fra\"iss\'e structures whose objects have finite big Ramsey degree and ask what consequences this has for the dynamics of the automorphism group. Motivated by a theorem of D. Devlin about the partition properties of the…

Logic · Mathematics 2017-03-21 Andy Zucker

We prove that certain classes of metrically homogeneous graphs omitting triangles of odd short perimeter as well as triangles of long perimeter have the extension property for partial automorphisms and we describe their Ramsey expansions.

Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…

Combinatorics · Mathematics 2018-05-22 Matěj Konečný

Ramsey theory is a central and active branch of combinatorics. Although Ramsey numbers for graphs have been extensively investigated since Ramsey's work in the 1930s, there is still an exponential gap between the best known lower and upper…

Combinatorics · Mathematics 2025-01-03 António Girão , Gal Kronenberg , Alex Scott

We investigate big Ramsey degrees of finite substructures of the universal countable homogeneous meet-tree and its binary variant. We prove that structures containing antichains have infinite big Ramsey degrees, and the big Ramsey degree of…

Combinatorics · Mathematics 2025-05-30 David Chodounský , Monroe Eskew , Thilo Weinert

In this paper we are interested in the existence of small and big Ramsey degrees of classes of finite unary algebras in arbitrary (not necessarily finite) algebraic language $\Omega$. We think of unary algebras as $M$-sets where $M =…

Combinatorics · Mathematics 2024-05-17 Dragan Mašulović

We prove that hypergraphs defined by low-degree polynomial inequalities contain large homogeneous subsets. Formally, let $H$ be an $r$-uniform hypergraph on $N$ vertices that is semialgebraic of constant description complexity, and each…

Combinatorics · Mathematics 2026-02-23 Azem Adibelli , István Tomon

We prove a general multidimensional invariance principle for a family of U-statistics based on freely independent non-commutative random variables of the type $U_n(S)$, where $U_n(x)$ is the $n$-th Chebyshev polynomial and $S$ is a standard…

Probability · Mathematics 2016-11-23 R. Simone

As a result of 33 intercontinental Zoom calls, we characterise big Ramsey degrees of the generic partial order in a similar way as Devlin characterised big Ramsey degrees of the generic linear order (the order of rationals).

We prove that for any homogeneous structure $\mathbf{K}$ in a language with finitely many relation symbols of arity at most two satisfying SDAP$^+$ (or LSDAP$^+$), there are spaces of subcopies of $\mathbf{K}$, forming subspaces of the…

Logic · Mathematics 2023-02-23 Natasha Dobrinen

One of the consequences of the Compactness Principle in structural Ramsey theory is that the small Ramsey degrees cannot exceed the corresponding big Ramsey degrees, thereby justifying the choice of adjectives. However, it is unclear what…

Logic · Mathematics 2024-07-30 Dragan Mašulović

Generalised indiscernibles highlight a strong link between model theory and structural Ramsey theory. In this paper, we use generalised indiscernibles as tools to prove results in both these areas. More precisely, we first show that a…

Logic · Mathematics 2024-08-13 Nadav Meir , Aris Papadopoulos , Pierre Touchard

We prove a Ramsey theorem for finite sets equipped with a partial order and a fixed number of linear orders extending the partial order. This is a common generalization of two recent Ramsey theorems due to Soki\'c. As a bonus, our proof…

Combinatorics · Mathematics 2015-02-17 Slawomir Solecki , Min Zhao