Parabolic subgroups in FC-type Artin groups

Parabolic subgroups are the building blocks of Artin groups. This paper extends previous results of Cumplido, Gebhardt, Gonzales-Meneses and Wiest, known only for parabolic subgroups of finite type Artin groups, to parabolic subgroups of FC-type Artin groups. We show that the class of finite type parabolic subgroups is closed under intersection. We also study an analog of the curve complex for mapping class group constructed by Cumplido et al. using parabolic subgroups. We extend the construction of this complex, called the complex of parabolic subgroups, to FC-type Artin groups. We show that this simplicial complex is, in most cases, infinite diameter and conjecture that it is δ-hyperbolic.     

On distance-regular Cayley graphs of generalized dicyclic groups

Let G be a generalized dicyclic group with identity 1. An inverse closed subset S of $G?\{1\}$ is called minimal if $〈S〉=G$ and there exists some $s\in S$ such that $〈S?\{s,s^{?1}\}〉\ne G$. In this paper, we characterize distance-regular Cayley graphs $\mathrm{Cay}(G,S)$ of G under the condition that S is minimal.     

Pure tetrahedral quadruple systems with index two

An oriented tetrahedron defined on four vertices is a set of four cyclic triples with the property that any ordered pair of vertices is contained in exactly one of the cyclic triples. A tetrahedral quadruple system of order $n$ with index $\lambda$, denoted by ${\text{TQS}}_{\lambda }\left(n\right)$, is a pair $\left(X,\mathrm{?}\right)$, where $X$ is an $n$‐set and $\mathrm{?}$ is a set of oriented tetrahedra (blocks) such that every cyclic triple on $X$ is contained in exactly $\lambda$ members of $\mathrm{?}$. A ${\text{TQS}}_{\lambda }\left(n\right)$ is pure if there do not exist two blocks with the same vertex set. When $\lambda =1$, the spectrum of a pure TQS $\left(n\right)$ has been completely determined by Ji. In this paper, we show that there exists a pure ${\text{TQS}}_2\left(n\right)$ if and only if $n\equiv 1,2\left(\mathrm{mod}3\right)$ and $n\ge 7$. A corollary is that a simple ${\text{QS}}_4\left(n\right)$ also exists if and only if $n\equiv 1,2\left(\mathrm{mod}3\right)$ and $n\ge 7$.     

Vertex-disjoint rainbow triangles in edge-colored graphs

Let $G$ be an edge-colored graph of order $n$. The minimum color degree of $G$, denoted by ${\delta }^c\left(G\right)$, is the largest integer $k$ such that for every vertex $v$, there are at least $k$ distinct colors on edges incident to $v$. We say that an edge-colored graph is rainbow if all its edges have different colors. In this paper, we consider vertex-disjoint rainbow triangles in edge-colored graphs. Li (2013) showed that if ${\delta }^c\left(G\right)\ge (n+1)∕2$, then $G$ contains a rainbow triangle and the lower bound is tight. Motivated by this result, we prove that if $n\ge 20$ and ${\delta }^c\left(G\right)\ge (n+2)∕2$, then $G$ contains two vertex-disjoint rainbow triangles. In particular, we conjecture that if ${\delta }^c\left(G\right)\ge (n+k)∕2$, then $G$ contains $k$ vertex-disjoint rainbow triangles. For any integer $k\ge 2$, we show that if $n\ge 16k-12$ and ${\delta }^c\left(G\right)\ge n∕2+k-1$, then $G$ contains $k$ vertex-disjoint rainbow triangles. Moreover, we provide sufficient conditions for the existence of $k$ edge-disjoint rainbow triangles.