Related papers: Big Ramsey degrees and the two-branching pseudotre…
The independence density of a finite hypergraph is the probability that a subset of vertices, chosen uniformly at random contains no hyperedges. Independence densities can be generalized to countable hypergraphs using limits. We show that,…
Finding the number of maximal subgroups of infinite index of a finitely generated group is a natural problem that has been solved for several classes of `geometric' groups (linear groups, hyperbolic groups, mapping class groups, etc). Here…
A quasiconformal tree is a doubling (compact) metric tree in which the diameter of each arc is comparable to the distance of its endpoints. We show that for each integer $n\geq 2$, the class of all quasiconformal trees with uniform branch…
In this paper, we study uniform rooted plane trees with given degree sequence. We show, under some natural hypotheses on the degree sequence, that these trees converge toward the so-called Inhomogeneous Continuum Random Tree after…
The distinguishing number of a structure is the smallest size of a partition of its elements so that only the trivial automorphism of the structure preserves each cell of the partition. We show that for any countable subset of the positive…
The celebrated Erd\H{o}s-Hajnal Conjecture says that in any proper hereditary class of finite graphs we are guaranteed to have a clique or anti-clique of size $n^c$, which is a much better bound than the logarithmic size that is provided by…
We consider critical multitype Bienaym\'e trees that are either irreducible or possess a critical irreducible component with attached subcritical components. These trees are studied under two distinct conditioning frameworks: first,…
Chvatal, Roedl, Szemeredi and Trotter proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In previous work, we proved the same result for 3-uniform hypergraphs. Here we extend this result to…
An infinite graph is said to be highly connected if the induced subgraph on the complement of any set of vertices of smaller size is connected. We continue the study of weaker versions of Ramsey Theorem on uncountable cardinals asserting…
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…
It is shown that every $2$-shifted Poisson structure on a finitely generated semi-free commutative differential graded algebra $A$ defines a very explicit infinitesimal $2$-braiding on the homotopy $2$-category of the symmetric monoidal…
We show that any graded digraph $D$ on $n$ vertices with maximum degree $\Delta$ has an oriented Ramsey number of at most $C^\Delta n$ for some absolute constant $C > 1$, improving upon a recent result of Fox, He, and Wigderson. In…
We consider a dichotomy for analytic families of trees stating that either there is a colouring of the nodes for which all but finitely many levels of every tree are nonhomogeneous, or else the family contains an uncountable antichain. This…
In this article, we introduce the first degrees of a cochain complex associated to a strict Lie 2-group whose cohomology is shown to extend the classical cohomology theory of Lie groups. In particular, we show that the second cohomology…
We prove that the genus of a finite-dimensional division algebra is finite whenever the center is a finitely generated field of any characteristic. We also discuss potential applications of our method to other problems, including the…
Let (L;C) be the (up to isomorphism unique) countable homogeneous structure carrying a binary branching C-relation. We study the reducts of (L;C), i.e., the structures with domain L that are first-order definable in (L;C). We show that up…
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively studied k-server problem. The proof is based on Ramsey-type…
We investigate the notion of a semi-retraction between two first order structures (in typically different signatures) that was introduced by the second author as a link between the Ramsey property and generalized indiscernible sequences. We…
Spanning trees of complete bipartite graphs exhibit a rich interaction between degree sequences and graph structure. In this paper, we obtain lower bounds on the number of isomorphism classes of spanning trees in $K_{a,b}, 2 \leq a \leq b$…
We categorify the notion of an infinitesimal braiding in a linear strict symmetric monoidal category, leading to the notion of a (strict) infinitesimal 2-braiding in a linear symmetric strict monoidal 2-category. We describe the associated…