English
Related papers

Related papers: Fraisse structures with SDAP+, Part II: Simply cha…

200 papers

This is Part I of a two-part series regarding Ramsey properties of Fraisse structures satisfying a property called SDAP+, which strengthens the Disjoint Amalgamation Property. We prove that every Fraisse structure in a finite relational…

Combinatorics · Mathematics 2022-07-14 Rebecca Coulson , Natasha Dobrinen , Rehana Patel

We formulate a property strengthening the Disjoint Amalgamation Property and prove that every Fraisse structure in a finite relational language with relation symbols of arity at most two having this property has finite big Ramsey degrees…

Combinatorics · Mathematics 2021-09-14 Rebecca Coulson , Natasha Dobrinen , Rehana Patel

This paper investigates big Ramsey degrees of unrestricted relational structures in (possibly) infinite languages. Despite significant progress in the study of big Ramsey degrees, the big Ramsey degrees of many classes of structures with…

In recent years, there has been much progress in the field of structural Ramsey theory, in particular in the study of big Ramsey degrees. In all known examples of infinite structures with finite big Ramsey degrees, there is in fact a single…

Logic · Mathematics 2025-10-01 Jan Hubička , Andy Zucker

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

In this paper we show that a countable structure admitting a finite monomorphic decomposition has finite big Ramsey degrees if and only if so does every monomorphic part in its minimal monomorphic decomposition. The necessary prerequisite…

Logic · Mathematics 2026-05-21 Dragan Mašulović , Veljko Toljić

This article is concerned with classes of relational structures that are closed under taking substructures and isomorphism, that have the joint embedding property, and that furthermore have the Ramsey property, a strong combinatorial…

Combinatorics · Mathematics 2015-05-28 Manuel Bodirsky

Classical Ramsey theory has successfully extended to relational structures, yielding a wealth of results that have profoundly influenced other areas of mathematics. Interestingly, the same development has not occurred in the case of dual…

Combinatorics · Mathematics 2025-07-02 Aleksa Džuklevski , Dragan Mašulović

We show that every free amalgamation class of finite structures with relations and (symmetric) partial functions is a Ramsey class when enriched by a free linear ordering of vertices. This is a common strengthening of the…

Combinatorics · Mathematics 2021-07-06 David M. Evans , Jan Hubička , Jaroslav Nešetřil

Almost any reasonable class of finite relational structures has the Ramsey property or a precompact Ramsey expansion. In contrast to that, the list of classes of finite algebras with the precompact Ramsey expansion is surprisingly short. In…

Combinatorics · Mathematics 2023-03-13 Dragan Masulovic

Showing that the Ramsey property holds for a class of finite structures can be an extremely challenging task and a slew of sophisticated methods have been proposed in literature. In this paper we propose a new strategy to show that a class…

Combinatorics · Mathematics 2018-01-30 Dragan Masulovic

We prove that each finite chain in the two-branching countable ultrahomogeneous pseudotree has finite big Ramsey degrees. This is in contrast to the recent result of Chodounsk\'{y}, Eskew, and Weinert that antichains of size two have…

Logic · Mathematics 2026-03-10 David Chodounský , Natasha Dobrinen , Thilo Weinert

We consider finitary approximations of the (embedding) Ramsey property. Using a class of homogeneous reducts of random ordered hypergraphs, we prove that these properties form a strict hierarchy. We also show that every class of finite…

Combinatorics · Mathematics 2023-07-28 Nadav Meir , Aris Papadopoulos

Big Ramsey degrees of finite structures are usually considered with respect to a Fra\"{i} ss\'e limit. Building mainly on the work of Devlin, Sauer, Laflamme and Van Th\'e, in this paper we consider structures which are not Fra\"{i} ss\'e…

Combinatorics · Mathematics 2018-07-06 Dragan Masulovic

Let F be a set of relational trees and let Forbh(F) be the class of all structures that admit no homomorphism from any tree in F; all this happens over a fixed finite relational signature $\sigma$. There is a natural way to expand Forbh(F)…

Combinatorics · Mathematics 2015-07-01 Jan Foniok

We prove that the universal homogeneous 3-uniform hypergraph has finite big Ramsey degrees. This is the first case where big Ramsey degrees are known to be finite for structures in a non-binary language. Our proof is based on the vector (or…

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

In Section 6 of the paper ``Fra\"{\i}ss\'{e}'s Conjecture and big Ramsey degrees of structures admitting finite monomorphic decomposition'', we applied the methods developed in earlier sections to show that a certain reduct of the generic…

Combinatorics · Mathematics 2026-05-21 Dragan Mašulović

One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…

Logic · Mathematics 2011-05-31 Manuel Bodirsky , Michael Pinsker

In this paper we provide explicit dual Ramsey statements for several classes of finite relational structures (such as finite linearly ordered graphs, finite linearly ordered metric spaces and finite posets with a linear extension) and…

Combinatorics · Mathematics 2018-07-31 Dragan Mašulović

In this paper we investigate algebraic properties of big Ramsey degrees in categories satisfying some mild conditions. As the first nontrivial consequence of the generalization we advocate in this paper we prove that small Ramsey degrees…

Combinatorics · Mathematics 2025-11-27 Dragan Mašulović
‹ Prev 1 2 3 10 Next ›