English
Related papers

Related papers: Complete graph decompositions and p-groupoids

200 papers

We introduce a graph decomposition which exists for all simple, connected graphs $G=(V,E)$. The decomposition $V = A \cup B \cup C$ is such that each vertex in $A$ has more neighbors in $B$ than in $A$ and vice versa. $C$ is `balanced':…

Combinatorics · Mathematics 2021-06-04 Stefan Steinerberger

We are interested in overgroups of the automorphism group of the Rado graph. One class of such overgroups is completely understood; this is the class of reducts. In this article we tie recent work on various other natural overgroups, in…

Combinatorics · Mathematics 2012-05-17 Peter Cameron , Claude Laflamme , Maurice Pouzet , Sam Tarzi , Robert Woodrow

Many common finite p-groups admit automorphisms of order coprime to p, and when p is odd, it is reasonably difficult to find finite p-groups whose automorphism group is a p-group. Yet the goal of this paper is to prove that the automorphism…

Group Theory · Mathematics 2013-05-09 Geir T. Helleloid , Ursula Martin

The goal of this paper is to construct and describe certain arithmetic subgroups of the automorphism group of a partially commutative group. More precisely, given an arbitrary finite graph $\Gamma$ we construct an arithmetic subgroup…

Group Theory · Mathematics 2008-03-17 Andrew J. Duncan , Ilya V. Kazachkov , Vladimir N. Remeslennikov

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…

Geometric Topology · Mathematics 2010-04-13 Jason A. Behrstock , Walter D. Neumann

A graph $G$ is {\em matching-decyclable} if it has a matching $M$ such that $G-M$ is acyclic. Deciding whether $G$ is matching-decyclable is an NP-complete problem even if $G$ is 2-connected, planar, and subcubic. In this work we present…

Discrete Mathematics · Computer Science 2023-06-22 Fábio Protti , Uéverton S. Souza

Let $G$ be a finite group and $\text{cd}(G)$ denote the character degree set for $G$. The prime graph $\Delta(G)$ is a simple graph whose vertex set consists of prime divisors of elements in $\text{cd}(G)$, denoted $\rho(G)$. Two primes…

Representation Theory · Mathematics 2019-01-14 Donnie Munyao Kasyoki , Paul Odhiambo Oleche

The group ring of the automorphism group of a p-group is studied using the automorphism groups of subgroups and quotient groups of P.

Representation Theory · Mathematics 2007-11-12 John Martino , Stewart Priddy

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…

Dynamical Systems · Mathematics 2018-10-08 Toke Meier Carlsen , Marius Lie Winger

We classify the finite quasisimple groups whose commuting graph is perfect and we give a general structure theorem for finite groups whose commuting graph is perfect.

Group Theory · Mathematics 2015-10-26 John R. Britnell , Nick Gill

We define a class of algebras describing links of binary isolating formulas on a set of realizations for a family of 1-types of a complete theory. We prove that a set of labels for binary isolating formulas on a set of realizations for a…

Logic · Mathematics 2012-05-16 Ilya V. Shulepov , Sergey V. Sudoplatov

Let X be an algebraic variety with an action of an algebraic group G. Suppose X has a full exceptional collection of sheaves, and these sheaves are invariant under the action of the group. We construct a semiorthogonal decomposition of…

Algebraic Geometry · Mathematics 2015-05-13 Alexei Elagin

We give a combinatorial characterization of the group of quasiconformal homeomorphisms of a closed, oriented surface $S$ of genus at least $2$. In particular, we prove they are exactly the automorphisms of a graph of essential quasicircles…

Geometric Topology · Mathematics 2026-01-16 Katherine Williams Booth , Alexander Nolte , Yvon Verberne

We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…

Computational Complexity · Computer Science 2025-12-01 Michal Čertík , Andreas Emil Feldmann , Jaroslav Nešetřil , Paweł Rzążewski

We consider the oriented graph whose vertices are isomorphism classes of finitely generated groups, with an edge from G to H if, for some generating set T in H and some sequence of generating sets S_i in G, the marked balls of radius i in…

Group Theory · Mathematics 2015-12-14 Laurent Bartholdi , Anna Erschler

Some varieties of groupoids and quasigroups generated by linear-bivariate polynomials $P(x,y)=a+bx+cy$ over the ring $\mathbb{Z}_n$ are studied. Necessary and sufficient conditions for such groupoids and quasigroups to obey identities which…

Group Theory · Mathematics 2014-08-06 Emmanuel Ilojide , Temitope Gbolahan Jaiyeola , O. O. Owojori

Let $G$ be a finite group, and let $\Delta(G)$ be the prime graph built on its set of conjugacy class sizes: this is the (simple undirected) graph whose vertices are the prime numbers dividing some conjugacy class size of $G$, and two…

Group Theory · Mathematics 2021-04-16 Víctor Sotomayor

In this article, we study the outer automorphism group of a group G decomposed as a finite graph of group with finite edge groups and finitely generated vertex groups with at most one end. We show that Out(G) is essentially obtained by…

Group Theory · Mathematics 2013-01-21 Mathieu Carette

We define and study graphs associated to hexagon decompositions of surfaces by curves and arcs. One of the variants is shown to be quasi-isometric to the pants graph, whereas the other variant is quasi-isometric to (a Cayley graph of) the…

Geometric Topology · Mathematics 2025-01-22 Funda Gültepe , Hugo Parlier

We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…

Combinatorics · Mathematics 2025-09-24 Martin Grohe , Pascal Schweitzer , Daniel Wiebking