53 citations · 216 across the 41 of their papers we have counts for
5 papers · 2 filters
Ramsey theorem for trees with successor operation
Martin Balko, David Chodounský, Natasha Dobrinen +4
We prove a general Ramsey theorem for trees with a successor operation. This theorem is a common generalization of the Carlson-Simpson Theorem and the Milliken Tree Theorem for reg…
EPPA numbers of graphs
David Bradley-Williams, Peter J. Cameron, Jan Hubička +1
If is a graph, and its induced subgraphs, and an isomorphism, we say that is a \emph{partial automorphism} of . In 1992, Hrushovski proved that…
Type-respecting amalgamation and big Ramsey degrees
Andrés Aranda, Samuel Braunfeld, David Chodounský +4
We give an infinitary extension of the Nešetřil-Rödl theorem for category of relational structures with special type-respecting embeddings.
Characterisation of the big Ramsey degrees of the generic partial order
Martin Balko, David Chodounský, Natasha Dobrinen +4
As a result of 33 intercontinental Zoom calls, we characterise big Ramsey degrees of the generic partial order. This is an infinitary extension of the well known fact that finite p…
Big Ramsey Degrees and Infinite Languages
Samuel Braunfeld, David Chodounský, Noé de Rancourt +3
This paper investigates big Ramsey degrees of unrestricted relational structures in (possibly) infinite languages. Despite significant progress in the study of big Ramsey degrees,…