Related papers: Dual Ramsey theorem for trees
We prove that every graph has a canonical tree of tree-decompositions that distinguishes all principal tangles (these include the ends and various kinds of large finite dense structures) efficiently. Here `trees of tree-decompositions' are…
At the beginning of 1950's Erd\H os and Rado suggested the investigation of the Ramsey-type results where the number of colors is not finite. This marked the birth of the so-called canonizing Ramsey theory. In 1985 Pr\"omel and Voigt made…
We prove two conjectures posed in 2016 concerning a generalization of the Sawayama-Th\'ebault Theorem and the Sawayama Lemma. We show that this generalized statement can be viewed in Laguerre geometry, which provides a natural framework for…
We present a new, category theoretic point of view on finite Ramsey theory. Our aims are as follows: -- to define the category theoretic notions needed for the development of finite Ramsey Theory, -- to state, in terms of these notions, the…
We generalize a famous tail Doob's inequality, relative two non-negative random variables, arising in the martingale theory, in two directions: on the more general source data and on the random variables belonging to the so-called Grand…
We explore the tree limits recently defined by Elek and Tardos. In particular, we find tree limits for many classes of random trees. We give general theorems for three classes of conditional Galton-Watson trees and simply generated trees,…
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.
The purpose of this survey is to provide a gentle introduction to several recent breakthroughs in graph Ramsey theory. In particular, we will outline the proofs (due to various groups of authors) of exponential improvements to the diagonal,…
Probability estimation is one of the fundamental tasks in statistics and machine learning. However, standard methods for probability estimation on discrete objects do not handle object structure in a satisfactory manner. In this paper, we…
In this series of papers, we advance Ramsey theory of colorings over partitions. In this part, a correspondence between anti-Ramsey properties of partitions and chain conditions of the natural forcing notions that homogenize colorings over…
A $biased\ graph$ is a pair $(G,\mathcal{B})$, where $G$ is a graph and $\mathcal{B}$ is a collection of `balanced' circuits of $G$ such that no $\Theta$-subgraph of $G$ contains precisely two balanced circuits. We prove a Ramsey-type…
This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite trees. MSO on infinite trees is a rich system, and its decidability ("Rabin's Tree Theorem") is one of the most powerful known results…
A probabilistic representation for initial value semilinear parabolic problems based on generalized random trees has been derived. Two different strategies have been proposed, both requiring generating suitable random trees combined with a…
We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize situations in which we can use arbitrary families of…
In this paper we study Ramsey numbers for trees of diameter 3 (bistars) vs., respectively, trees of diameter 2 (stars), complete graphs, and many complete graphs. In the case of bistars vs. many complete graphs, we determine this number…
No natural principle is currently known to be strictly between the arithmetic comprehension axiom (ACA) and Ramsey's theorem for pairs (RT^2_2) in reverse mathematics. The tree theorem for pairs (TT^2_2) is however a good candidate. The…
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…
We give a simple proof of the "tree-width duality theorem" of Seymour and Thomas that the tree-width of a finite graph is exactly one less than the largest order of its brambles.
The Theorems of Hindman and van der Waerden belong to the classical theorems of partition Ramsey Theory. The Central Sets Theorem is a strong simultaneous extension of both theorems that applies to general commutative semigroups. We give a…
Sturm oscillation theorem for second order differential equations was generalized to systems and higher order equations with positive leading coefficient by several authors. What we propose here is a Sturm oscillation theorem for systems of…