Related papers: Ramsey theorem for trees with successor operation
We study the first-order model checking problem on two generalisations of pushdown graphs. The first class is the class of nested pushdown trees. The other is the class of collapsible pushdown graphs. Our main results are the following.…
Ramsey's theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set H such that all n-element subsets of H have the same color. The strength of consequences of Ramsey's theorem has…
We discuss several connections between discrete and continuous random trees. In the discrete setting, we focus on Galton-Watson trees under various conditionings. In particular, we present a simple approach to Aldous' theorem giving the…
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…
Every function over the natural numbers has an infinite subdomain on which the function is non-decreasing. Motivated by a question of Dzhafarov and Schweber, we study the reverse mathematics of variants of this statement. It turns out that…
We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…
We prove a generalization of the infinite quantum Ramsey theorem of Kennedy et al. (arXiv:1711.09526), showing that it follows from an archetypical "selective" pattern satisfied by certain families of projections in an infinite-dimensional…
We prove a generalization of Gowers' theorem for $\mathrm{FIN}_{k}$ where, instead of the single tetris operation $T:\mathrm{FIN}_{k}\rightarrow \mathrm{FIN}_{k-1}$, one considers all maps from $\mathrm{FIN}_{k}$ to $\mathrm{FIN}_{j}$ for…
The Pathwidth Theorem states that if a class of graphs has unbounded pathwidth, then it contains all trees as graph minors. We prove a similar result for dense graphs. More precisely, we give a finite family of tree-like patterns and prove…
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…
We extend the results of B. Bollobas, O. Riordan, J. Spencer, G. Tusnady, and Mori. We consider a model of random tree growth, where at each time unit a new node is added and attached to an already existing node chosen at random. The…
We study the possible values of the matching number among all trees with a given degree sequence as well as all bipartite graphs with a given bipartite degree sequence. For tree degree sequences, we obtain closed formulas for the possible…
We define the continuous modeling property for first-order structures and show that a first-order structure has the continuous modelling property if and only if its age has the embedding Ramsey property. We use generalized indiscernible…
In this paper we study a very general finite Ramsey theorem, where both the sets being colored and the homogeneous set must satisfy some largeness notion. For the homogeneous set this has already been done using the notion of…
Courcelle's Theorem is an important result in graph theory, proving the existence of linear-time algorithms for many decision problems on graphs whose tree-width is bounded by a constant. The purpose of this text is twofold: to provide an…
We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…
We give an almost entirely model-theoretic account of both Ramsey classes of finite structures and of generalized indiscernibles as studied in special cases in (for example) [7], [9]. We understand "theories of indiscernibles" to be special…
Among the Ramsey-type hierarchies, namely, Ramsey's theorem, the free set, the thin set and the rainbow Ramsey theorem, only Ramsey's theorem is known to collapse in reverse mathematics. A promising approach to show the strictness of the…
We survey results and open problems relating degree conditions with tree containment in graphs, random graphs, digraphs and hypergraphs, and their applications in Ramsey theory.
In this paper, we look at an unambiguous version of Simon's forest factorization theorem, a very deep result which has wide connections in algebra, logic and automata. Given a morphism $\varphi$ from $\Sigma^+$ to a finite semigroup $S$, we…