Related papers: Genus bounds in right-angled Artin groups

In an earlier paper, the present authors (2013) introduced the altermatic number of graphs and used Tucker's Lemma, an equivalent combinatorial version of the Borsuk-Ulam Theorem, to show that the altermatic number is a lower bound for the…

We show that the fundamental groups of any two closed irreducible non-geometric graph-manifolds are quasi-isometric. This answers a question of Kapovich and Leeb. We also classify the quasi-isometry types of fundamental groups of…

We compute the $p$-central and exponent-$p$ series of all right angled Artin groups, and compute the dimensions of their subquotients. We also describe their associated Lie algebras, and relate them to the cohomology ring of the group as…

Artin groups of finite type are not as well understood as braid groups. This is due to the additional geometric properties of braid groups coming from their close connection to mapping class groups. For each Artin group of finite type, we…

A number of famous results about triangle-free graphs determine the maximum chromatic number of graphs of order n with minimum degree greater than n/3. In this note these results are extended to Kr-free graphs.

Let $R$ be a ring (not necessary commutative) with non-zero identity. The unit graph of $R$, denoted by $G(R)$, is a graph with elements of $R$ as its vertices and two distinct vertices $a$ and $b$ are adjacent if and only if $a+b$ is a…

We show that for a sufficiently simple surface $S$, a right-angled Artin group $A(\Gamma)$ embeds into $\Mod(S)$ if and only if $\Gamma$ embeds into the curve graph $\mC(S)$ as an induced subgraph. When $S$ is sufficiently complicated,…

We study the infinite graph of $n$-dimensional rectangular grid that doesn't appear distance regular and the distance regular colorings of this graph, which are defined as the distance colorings with respect to completely regular codes. It…

We give new upper bounds on the stable commutator lengths of Dehn twists in mapping class groups and new lower bounds on the stable commutator lengths of Dehn twists in hyperelliptic mapping class groups. In particular, we show that the…

A graph with chromatic number $k$ is called $k$-chromatic. Using computational methods, we show that the smallest triangle-free 6-chromatic graphs have at least 32 and at most 40 vertices. We also determine the complete set of all…

We extend previous results by Cumplido, Martin and Vaskou on parabolic subgroups of large-type Artin groups to a broader family of two-dimensional Artin groups. In particular, we prove that an arbitrary intersection of parabolic subgroups…

Motivated by a recent conjecture of the first author, we prove that every properly coloured triangle-free graph of chromatic number $\chi$ contains a rainbow independent set of size $\lceil\frac12\chi\rceil$. This is sharp up to a factor…

We prove that an Artin group splits over infinite cyclic subgroups if and only if its defining graph has a separating vertex, and explicitly construct a JSJ decomposition over infinite cyclic subgroups for all Artin groups. We then use…

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,…

We show that for any periodic mapping class, there is some power which maps a nonseparating, simple closed curve to a distinct, disjoint nonseparating curve. As an application of this result, we introduce the notion of stable specific…

In this article, we characterise geometrically when a right-angled Artin group splits over an abelian subgroup. More precisely, given a finite graph $\Gamma$, we show that $A(\Gamma)$ splits over an abelian subgroup if and only if it is…

For a graph $G$ and a positive integer $k$, a vertex labelling $f:V(G)\to\{1,2\ldots,k\}$ is said to be $k$-distinguishing if no non-trivial automorphism of $G$ preserves the sets $f^{-1}(i)$ for each $i\in\{1,\ldots,k\}$. The…

Finite graphs that have a common chromatic polynomial have the same number of regular $n$-colorings. A natural question is whether there exists a natural bijection between regular $n$-colorings. We address this question using a functorial…

The prime graph (or Gruenberg-Kegel graph) of a finite group $G$ is a familiar graph. In this paper first, we investigate the structure of the finite groups with a non-complete prime graph. Then we prove that every alternating group…

Let $S$ be a finite non-commutative semigroup. The commuting graph of $S$, denoted $\cg(S)$, is the graph whose vertices are the non-central elements of $S$ and whose edges are the sets $\{a,b\}$ of vertices such that $a\ne b$ and $ab=ba$.…