Related papers: Path lifting properties and embedding between RAAG…

We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with…

A graph $G$ is embeddable in $\mathbb{R}^d$ if vertices of $G$ can be assigned with points of $\mathbb{R}^d$ in such a way that all pairs of adjacent vertices are at the distance 1. We show that verifying embeddability of a given graph in…

This paper studies higher index theory for a random sequence of bounded degree, finite graphs with diameter tending to infinity. We show that in a natural model for such random sequences the following hold almost surely: the coarse…

Feature extraction and dimension reduction for networks is critical in a wide variety of domains. Efficiently and accurately learning features for multiple graphs has important applications in statistical inference on graphs. We propose a…

In this article, we consider qualified notions of geometric finiteness in mapping class groups called parabolically geometrically finite (PGF) and reducibly geometrically finite (RGF). We examine several constructions of subgroups and…

We give a necessary and sufficient condition for a graph to have a right-angled Artin group as its braid group for braid index $\ge 5$. In order to have the necessity part, graphs are organized into small classes so that one of homological…

Graph embedding is a powerful method in parallel computing that maps a guest network $G$ into a host network $H$. The performance of an embedding can be evaluated by certain parameters, such as the dilation, the edge congestion and the…

We study the outer automorphism group of a right-angled Artin group $A_\Gamma$ with finite defining graph $\Gamma$. We construct a subnormal series for $Out(A_\Gamma)$ such that each consecutive quotient is either finite, free-abelian,…

An automorphism of a graph is called quasi-semiregular if it fixes a unique vertex of the graph and its remaining cycles have the same length. This kind of symmetry of graphs was first investigated by Kutnar, Malni\v{c}, Mart\'{i}nez and…

Let $G$ be a Cayley graph of the elementary abelian $2$-group $\mathbb{Z}_2^{n}$ with respect to a set $S$ of size $d$. We prove that for any such $G, S$ and $d$, the maximum degree of any induced subgraph of $G$ on any set of more than…

We study the right-angled Artin group action on the extension graph. We show that this action satisfies a certain finiteness property, which is a variation of a condition introduced by Delzant and Bowditch. As an application we show that…

The algorithm of Gutwenger et al. to insert an edge $e$ in linear time into a planar graph $G$ with a minimal number of crossings on $e$, is a helpful tool for designing heuristics that minimize edge crossings in drawings of general graphs.…

In this paper we describe an algorithm that embeds a graph metric $(V,d_G)$ on an undirected weighted graph $G=(V,E)$ into a distribution of tree metrics $(T,D_T)$ such that for every pair $u,v\in V$, $d_G(u,v)\leq d_T(u,v)$ and…

We prove a structural characterization of graphs that forbid a fixed graph $H$ as an immersion and can be embedded in a surface of Euler genus $\gamma$. In particular, we prove that a graph $G$ that excludes some connected graph $H$ as an…

We give a group theoretic characterization of geodesics with superlinear divergence in the Cayley graph of a right-angled Artin group A(G) with connected defining graph G. We use this to determine when two points in an asymptotic cone of…

We characterize groups quasi-isometric to a right-angled Artin group $G$ with finite outer automorphism group. In particular all such groups admit a geometric action on a $CAT(0)$ cube complex that has an equivariant "fibering" over the…

Let $\mathcal{C}$ be a class of finite groups closed under taking subgroups, quotients, and extensions with abelian kernel. The right-angled Artin pro-$\mathcal{C}$ group $G_\Gamma$ (pro-$\mathcal{C}$ RAAG for short) is the…

For a pair $(G,\mathcal{P})$ consisting of a group and finite collection of subgroups, we introduce a simplicial $G$-complex $\mathcal{K}(G,\mathcal{P})$ called the coset intersection complex. We prove that the quasi-isometry type and the…

Huynh, Joret, Micek, Seweryn, and Wollan (Combinatorica, 2022) introduced a graph parameter, later referred to as 2-treedepth and denoted $\mathrm{td}_2(\cdot)$. The parameter is the natural 2-connected version of treedepth. For every…

Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd\H{o}s-R\'enyi graphs are typically asymmetric, real…