Related papers: Schreier graphs: transitivity and coverings

We uncover a connection between two seemingly unrelated notions: lettericity, from structural graph theory, and geometric griddability, from the world of permutation patterns. Both of these notions capture important structural properties of…

The theory of voltage graphs has become a standard tool in the study graphs admitting a semiregular group of automorphisms. We introduce the notion of a cyclic generalised voltage graph to extend the scope of this theory to graphs admitting…

We introduce a novel definition of curvature for hypergraphs, a natural generalization of graphs, by introducing a multi-marginal optimal transport problem for a naturally defined random walk on the hypergraph. This curvature, termed…

We demonstrate that graph-based models are fully capable of representing higher-order interactions, and have a long history of being used for precisely this purpose. This stands in contrast to a common claim in the recent literature on…

We interpret realizations of a graph on the sphere up to rotations as elements of a moduli space of curves of genus zero. We focus on those graphs that admit an assignment of edge lengths on the sphere resulting in a flexible object. Our…

We relativise the Thomassen--Woess definition of accessibility in graphs, defining what it means for a graph to be accessible relative to a peripheral system. In the case of locally finite, quasi-transitive graphs, we characterise relative…

In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…

We present several characterizations of circle graphs, which follow from Bouchet's circle graph obstructions theorem.

We complete the proof of the Nisnevich conjecture in equal characteristic: for a smooth algebraic variety $X$ over a field $k$, a $k$-smooth divisor $D \subset X$, and a reductive $X$-group $G$ whose base change $G_D$ is totally isotropic,…

The theory of covering spaces is often used to prove the Nielsen-Schreier theorem, which states that every subgroup of a free group is free. We apply the more general theory of semicovering spaces to obtain analogous subgroup theorems for…

We show that a relatively hyperbolic graph with uniformly hyperbolic peripheral subgraphs is hyperbolic. As an application, we show that the disc graph and the electrified disc graph of a handlebody H of genus g>1 are hyperbolic, and we…

We define a free product of connected simple graphs that is equivalent to several existing definitions when the graphs are vertex-transitive but differs otherwise. The new definition is designed for the automorphism group of the free…

We define and investigate the concept of the groupoid representation induced by a representation of the isotropy subgroupoid. Groupoids in question are locally compact transitive topological groupoids. We formulate and prove the…

We give certain properties which are satisfied by the descendant set of a vertex in an infinite, primitive, distance transitive digraph of finite out-valency and provide a strong structure theory for digraphs satisfying these properties. In…

In the paper the foundation of the $k$-orbit theory is developed. The theory opens a new simple way to the investigation of groups and multidimensional symmetries. The relations between combinatorial symmetry properties of a $k$-orbit and…

We prove that the genus of the Turaev surface of a link diagram is determined by a graph whose vertices correspond to the boundary components of the maximal alternating regions of the link diagram. Furthermore, we use these graphs to…

In this paper, we provide upper and lower bounds on the crossing numbers of dense graphs on surfaces, which match up to constant factors. First, we prove that if $G$ is a dense enough graph with $m$ edges and $\Sigma$ is a surface of genus…

For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…

We extend the characterization of context-free groups of Muller and Schupp in two ways. We first show that for a quasi-transitive inverse graph $\Gamma$, being quasi-isometric to a tree, or context-free (finitely many end-cones types), or…

Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…