Related papers: A Dual Ramsey Theorem for Finite Ordered Oriented …
We present a unified approach to proving Ramsey-type theorems for graphs with a forbidden induced subgraph which can be used to extend and improve the earlier results of Rodl, Erdos-Hajnal, Promel-Rodl, Nikiforov, Chung-Graham, and…
Recently, bidirected graphs have received increasing attention from the graph theory community with both structural and algorithmic results. Bidirected graphs are a generalization of directed graphs, consisting of an undirected graph…
In this paper, we investigate a variant of Ramsey numbers called defective Ramsey numbers where cliques and independent sets are generalized to $k$-dense and $k$-sparse sets, both commonly called $k$-defective sets. We focus on the…
We consider properties of edge-colored vertex-ordered graphs, i.e., graphs with a totally ordered vertex set and a finite set of possible edge colors. We show that any hereditary property of such graphs is strongly testable, i.e., testable…
This paper gives a self-contained group-theoretic proof of a dual version of a theorem of Ore on distributive intervals of finite groups. We deduce a bridge between combinatorics and representations in finite group theory.
Mapping class groups of locally finite graphs are the analogue of those of infinite-type surfaces, and serve as a "big" version of $\text{Out}(F_n)$. In this paper, we investigate which of these mapping class groups have a dense conjugacy…
We survey some recent results in Ramsey theory. We indicate their connections with topological dynamics. On the foundational side, we describe an abstract approach to finite Ramsey theory. We give one new application of the abstract…
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…
Nash-Williams' Strong Immersion Conjecture states that graphs are well-quasi-ordered by the strong immersion relation. That is, given infinitely many graphs, one graph contains another graph as a strong immersion. In this paper we study the…
We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…
In this short note we confirm the deep structural correspondence between the complexity of a countable scattered chain (= strict linear order) and its big Ramsey combinatorics: we show that a countable scattered chain has finite big Ramsey…
In a recent paper \cite{So} S. Solecki proves a finite self dual Ramsey theorem that in a natural way gives simultaneously the classical finite Ramsey theorem \cite{Ra} and the Graham-Rothschild theorem \cite{Gr-Ro}. In this paper we prove…
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 regularly branching trees. Our theorem has a number of…
A directed graph is set-homogeneous if, whenever U and V are isomorphic finite subdigraphs, there is an automorphism g of the digraph with U^g=V. Here, extending work of Lachlan on finite homogeneous digraphs, we classify finite…
Recently, one has seen a surge of interest in developing such methods including ones for learning such representations for (undirected) graphs (while preserving important properties). However, most of the work to date on embedding graphs…
End-spaces of infinite graphs naturally generalise the Freudenthal boundary and sit at the interface between graph theory, geometric group theory and topology. Our main result is that every end-space can topologically be represented by a…
Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two different ways. For the first of these, we show that…
In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered…
We present an approach to reduced-order modelling that builds off recent graph-theoretic work for representation, exploration, and analysis of computed states of physical systems (Banerjee et al., Comp. Meth. App. Mech. Eng., 351, 501-530,…
The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…