English
Related papers

Related papers: On commuting elements and embeddings of graph grou…

200 papers

Let $\Gamma$ be the infinite cyclic group on a generator $x.$ To avoid confusion when working with $\mathbb Z$-modules which also have an additional $\mathbb Z$-action, we consider the $\mathbb Z$-action to be a $\Gamma$-action instead.…

Rings and Algebras · Mathematics 2023-02-23 Roozbeh Hazrat , Lia Vas

We prove a decomposition theorem for the class of triangle-free graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph. We prove that every graph of girth at least~5 in this class is…

Combinatorics · Mathematics 2020-12-01 Nicolas Trotignon , Kristina Vušković

A \emph{self-complementary} graph is a graph isomorphic to its complement. An isomorphism between $G$ and its complement, viewed as a permutation of $V(G)$, is then called an \emph{antimorphism}. A \emph{skew partition} of $G$ is a…

Combinatorics · Mathematics 2013-08-29 Nicolas Trotignon

Given a graph, we associate each edge with the transposition which exchanges the endvertices. Fixing a linear order on the edge set, we obtain a permutation of the vertices. D\'enes proved that the permutation is a full cyclic permutation…

Combinatorics · Mathematics 2024-04-04 Shuhei Tsujie , Ryo Uchiumi

It is well-known that every vertex-transitive graph admits a representation as a coset graph. In this paper, we extend this construction by introducing monodromy graphs defined through double cosets. Our main result establishes that every…

Combinatorics · Mathematics 2025-09-23 Kai Yuan , Yan Wang

Following Alspach and Parsons, a {\em metacirculant graph} is a graph admitting a transitive group generated by two automorphisms $\rho$ and $\sigma$, where $\rho$ is $(m,n)$-semiregular for some integers $m \geq 1$, $n \geq 2$, and where…

Combinatorics · Mathematics 2007-05-23 Dragan Marusic , Primoz Sparl

Given a finite group $G$ and a subset $X$ of $G$, the commuting graph of $G$ on $X$, denoted by ${\cal C}(G,X)$, is the graph that has $X$ as its vertex set with $x,y\in X$ joined by an edge whenever $x\neq y$ and $xy=yx$. Let $T$ be a…

Group Theory · Mathematics 2018-07-06 Julio C. M. Pezzott , Irene N. Nakaoka

Let $R$ be a finite ring and $r\in R$. The $r$-noncommuting graph of $R$, denoted by $\Gamma_R^r$, is a simple undirected graph whose vertex set is $R$ and two vertices $x$ and $y$ are adjacent if and only if $[x,y] \neq r$ and $-r$. In…

Rings and Algebras · Mathematics 2021-08-23 Rajat Kanti Nath , Monalisha Sharma , Parama Dutta , Yilun Shang

Let G be a graph. It was proved that if G is a planar graph without {4, 6, 7}-cycles and without two 5-cycles sharing exactly one edge, then G 3-colorable. We observed that the proof of this result is not correct.

Combinatorics · Mathematics 2008-10-21 S. Akbari , Behrooz Bagheri Gh

A (1,{\lambda})-embedded graph is a graph that can be embedded on a surface with Euler characteristic {\lambda} so that each edge is crossed by at most one other edge. A graph G is called {\alpha}-linear if there exists an integral constant…

Combinatorics · Mathematics 2011-12-08 Xin Zhang , Guizhen Liu , Jian-Liang Wu

In this paper, we study the structure of the permutability graphs of subgroups, and the permutability graphs of non-normal subgroups of the following groups: the dihedral groups $D_n$, the generalized quaternion groups $Q_n$, the…

Combinatorics · Mathematics 2023-06-01 R. Rajkumar , P. Devi

Let G be a chordal graph, X(G) the complement of the associated complex arrangement and Gamma(G) the fundamental group of X(G). We show that Gamma(G) is a limit of colored braid groups over the poset of simplices of G. When G = G_T is the…

Algebraic Topology · Mathematics 2007-05-23 Frederic Chapoton , Patrick Polo

A graph $\Gamma$ is $k$-connected-homogeneous ($k$-CH) if $k$ is a positive integer and any isomorphism between connected induced subgraphs of order at most $k$ extends to an automorphism of $\Gamma$, and connected-homogeneous (CH) if this…

Group Theory · Mathematics 2020-03-10 Alice Devillers , Joanna B. Fawcett , Cheryl E. Praeger , Jin-Xin Zhou

For a group $H$ and a non empty subset $\Gamma\subseteq H$, the commuting graph $G=\mathcal{C}(H,\Gamma)$ is the graph with $\Gamma$ as the node set and where any $x,y \in \Gamma$ are joined by an edge if $x$ and $y$ commute in $H$. We…

Group Theory · Mathematics 2017-12-11 Umar Hayat , Álvaro Nolla de Celis , Fawad Ali

We prove a refinement of the flat wall theorem of Robertson and Seymour to undirected group-labelled graphs $(G,\gamma)$ where $\gamma$ assigns to each edge of an undirected graph $G$ an element of an abelian group $\Gamma$. As a…

Combinatorics · Mathematics 2024-06-25 Robin Thomas , Youngho Yoo

A number of properties of spherical Artin groups extend to Garside groups, defined as the groups of fractions of monoids where least common multiples exist, there is no nontrivial unit, and some additional finiteness conditions are…

Group Theory · Mathematics 2007-05-23 Patrick Dehornoy

Let G denote a group and let W be an algebra over a commutative ring R. We will say that W is a G-graded twisted algebra (not necessarily commutative, neither associative) if there exists a G-grading W=\bigoplus_{g \in G}W_{g} where each…

Rings and Algebras · Mathematics 2013-01-25 Juan D. Velez , Luis A. Wills , Natalia Agudelo

We examine from an invariant theory viewpoint the monoid algebras for two monoids having large symmetry groups. The first monoid is the free left-regular band on $n$ letters, defined on the set of all injective words, that is, the words…

Combinatorics · Mathematics 2025-08-11 Sarah Brauner , Patricia Commins , Victor Reiner

A Mumford group is a discontinuous subgroup $\Gamma$ of PGL(2,K), where K denotes a non archimedean valued field, such that the quotient by $\Gamma$ is a curve of genus 0. As abstract group $\Gamma$ is an amalgam of a finite tree of finite…

Algebraic Geometry · Mathematics 2018-06-11 Harm H. Voskuil , Marius van der Put

The commuting graph of a non-commutative ring $R$ with center $Z(R)$ is a simple undirected graph whose vertex set is $R\setminus Z(R)$ and two vertices $x, y$ are adjacent if and only if $xy = yx$. In this paper, we compute the spectrum…

Spectral Theory · Mathematics 2016-04-12 Jutirekha Dutta , Rajat Kanti Nath
‹ Prev 1 8 9 10 Next ›