相关论文: Some classical model theoretic aspects of bounded …

The central theorem of topological graph theory states that the graph minor relation is a well-quasi-order on graphs. It has far-reaching consequences, in particular in the study of graph structures and the design of (parameterized)…

We show that every commutative idempotent monoid (a.k.a lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr [J. Comb.~Theory, Ser.~B, 1980] and the degree bound is best-possible. On the other…

We show that many graphs with bounded treewidth can be described as subgraphs of the strong product of a graph with smaller treewidth and a bounded-size complete graph. To this end, define the "underlying treewidth" of a graph class…

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…

Although the ``scale-free'' literature is large and growing, it gives neither a precise definition of scale-free graphs nor rigorous proofs of many of their claimed properties. In fact, it is easily shown that the existing theory has many…

This note studies the Burnside problem for homeomorphism groups of compact connected manifolds. For surfaces, we prove that the identity component of the homeomorphism group is torsion-free precisely when the surface is not the sphere,…

The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…

We apply a recent duality theorem for tangles in abstract separation systems to derive tangle-type duality theorems for width-parameters in graphs and matroids. We further derive a duality theorem for the existence of clusters in large data…

The study of Locally Checkable Labelings (LCLs) has led to a remarkably precise characterization of the distributed time complexities that can occur on bounded-degree trees. A central feature of this complexity landscape is the existence of…

We prove the existence of continuous boundary extensions (Cannon-Thurston maps) for the inclusion of a vertex space into a tree of (strongly) relatively hyperbolic spaces satisfying the qi-embedded condition. This implies the same result…

We use model-theoretic tools originating from stability theory to derive a result we call the Finitary Substitute Lemma, which intuitively says the following. Suppose we work in a stable graph class C, and using a first-order formula {\phi}…

We prove that if $ T $ is a semi-special tree that is not special, then there exists a graph $ G $, formed as an inflation of a sparse $ T $-graph, such that for any special tree $ S $, $ G $ is not a subdivision of an inflation of an…

Several min-max relations in graph theory can be expressed in the framework of the Erd\H{o}s-P\'osa property. Typically, this property reveals a connection between packing and covering problems on graphs. We describe some recent techniques…

In this paper we consider pushdown graphs, i.e. infinite graphs that can be described as transition graphs of deterministic real-time pushdown automata. We consider the case where some vertices are designated as being final and we built, in…

We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the…

We study finite $p$-subgroups of birational automorphism groups. By virtue of boundedness theorem of Fano varieties, we prove that there exists a constant $R(n)$ such that a rationally connected variety of dimension $n$ over an…

We explore new interactions between finite model theory and classical streams of universal algebra and semigroup theory. A key result is an example of finite algebras whose variety is not finitely axiomatisable in first order logic, but…

We show that for every graph $H$, there is a hereditary weakly sparse graph class $\mathcal C_H$ of unbounded treewidth such that the $H$-free (i.e., excluding $H$ as an induced subgraph) graphs of $\mathcal C_H$ have bounded treewidth.…

The Graph Minor Theorem of Robertson and Seymour asserts that any graph property, whatsoever, is determined by an associated finite list of graphs. We view this as an impressive generalization of Kuratowski's theorem, which characterizes…

We extend \cite[Theorem 4.5]{DGNO} and \cite[Theorem 4.22]{LKW} to positive characteristic (i.e., to the finite, not necessarily fusion, case). Namely, we prove that if $\D$ is a finite non-degenerate braided tensor category over an…