English
Related papers

Related papers: A class of semiprimitive groups that are graph-res…

200 papers

Given a finite group $G$, its prime graph $\Gamma(G)$ (also known as its Gruenberg-Kegel graph) is the graph whose vertices are the prime divisors of $|G|$ and where edges $\{p, q\}$ exist whenever $G$ contains an element of order $pq$. We…

Group Theory · Mathematics 2025-11-21 Lucas Alland , Andrei Fridman , Thomas Michael Keller

We study the number of connected graphs with $n$ vertices that cannot be written as the cartesian product of two graphs with fewer vertices. We give an upper bound which implies that for large $n$ almost all graphs are both connected and…

Combinatorics · Mathematics 2024-02-23 Marco Aldi

Suppose that $\tilde{G}$ is a connected reductive group defined over a field $k$, and $\Gamma$ is a finite group acting via $k$-automorphisms of $\tilde{G}$ satisfying a certain quasi-semisimplicity condition. Then the connected part of the…

Representation Theory · Mathematics 2014-07-28 Jeffrey D. Adler , Joshua M. Lansky

Let $n$ be a positive integer, $q$ be a prime power, and $V$ be a vector space of dimension $n$ over $\mathbb{F}_q$. Let $G := V \rtimes G_0$, where $G_0$ is an irreducible subgroup of ${\rm GL}(V)$ which is maximal by inclusion with…

Combinatorics · Mathematics 2016-01-29 Carmen Amarra , Michael Giudici , Cheryl E. Praeger

In 1979 Frankl conjectured that in a finite non-trivial union-closed collection of sets there has to be an element that belongs to at least half the sets. We show that this is equivalent to the conjecture that in a finite non-trivial graph…

Combinatorics · Mathematics 2013-05-17 Henning Bruhn , Pierre Charbit , Oliver Schaudt , Jan Arne Telle

The operation of switching a graph $\Gamma$ with respect to a subset $X$ of the vertex set interchanges edges and non-edges between $X$ and its complement, leaving the rest of the graph unchanged. This is an equivalence relation on the set…

Combinatorics · Mathematics 2015-02-19 Peter J. Cameron , Pablo Spiga

In this paper, we study commutative zero-divisor semigroups determined by graphs. We prove a uniqueness theorem for a class of graphs. We show two classes of graphs that have no corresponding semigroups. In particular, any complete graph…

Rings and Algebras · Mathematics 2007-05-23 Tongsuo Wu , Li Chen

Determining an upper bound on $s$ for finite vertex-primitive $s$-arc-transitive digraphs has received considerable attention dating back to a question of Praeger in 1990. It was shown by Giudici and Xia that the smallest upper bound on $s$…

Combinatorics · Mathematics 2024-02-23 Junyan Chen , Lei Chen , Michael Giudici , Jing Jian Li , Cheryl E. Praeger , Binzhou Xia

For each $n\ge 14$, we provide an example of a linklessly embeddable, Tutte-4-connected graph of order $n$.

Combinatorics · Mathematics 2021-06-16 Andrei Pavelescu , Elena Pavelescu

Given an adaptable separated graph, we construct an associated groupoid and explore its type semigroup. Specifically, we first attach to each adaptable separated graph a corresponding semigroup, which we prove is an $E^*$-unitary inverse…

Operator Algebras · Mathematics 2020-02-03 Pere Ara , Joan Bosa , Enrique Pardo , Aidan Sims

We determine all factorisations $X=AB$, where $X$ is a finite almost simple group and $A,B$ are core-free subgroups such that $A\cap B$ is cyclic or dihedral. As a main application, we classify the graphs $\Gamma$ admitting an almost simple…

Group Theory · Mathematics 2024-05-24 Martin W. Liebeck , Cheryl E. Praeger

We resolve Stillman's conjecture for families of polynomial rings that are graded by any semigroup under mild conditions. Conversely, we show that these conditions are necessary for the existence of a Stillman bound. This has applications…

Commutative Algebra · Mathematics 2025-04-15 John Cobb , Nathaniel Gallup , John Spoerl

A classification is given of rank 3 group actions which are quasiprimitive but not primitive. There are two infinite families and a finite number of individual imprimitive examples. When combined with earlier work of Bannai, Kantor,…

Group Theory · Mathematics 2014-02-26 Alice Devillers , Michael Giudici , Cai Heng Li , Geoffrey Pearce , Cheryl E. Praeger

We classify the countable ultrahomogeneous 2-vertex-colored graphs in which the color classes are imprimitive, i.e., up to complementation they form disjoint unions of cliques. This generalizes work by Jenkinson, Lockett and Truss as well…

Combinatorics · Mathematics 2023-06-16 Sofia Brenner , Irene Heinrich

We construct a connected cubic nonnormal Cayley graph on $\mathrm{A}_{2^m-1}$ for each integer $m\geqslant4$ and determine its full automorphism group. This is the first infinite family of connected cubic nonnormal Cayley graphs on…

Combinatorics · Mathematics 2019-06-21 Jiyong Chen , Binzhou Xia , Jin-Xin Zhou

A graph $G$ is said to be $p$-periodic, if the automorphism group $Aut(G)$ contains an element of order $p$ which preserves no edges. In this paper, we investigate the behavior of graph polynomials (Negmai and Tutte) with respect to graph…

Combinatorics · Mathematics 2011-04-01 Nafaa Chbili

We develop a theory of type semigroups for arbitrary twisted, not necessarily Hausdorff \'etale groupoids. The type semigroup is a dynamical version of the Cuntz semigroup. We relate it to traces, ideals, pure infiniteness, and stable…

Operator Algebras · Mathematics 2025-03-28 Bartosz K. Kwaśniewski , Ralf Meyer , Akshara Prasad

We show that the full group C$^*$-algebra of the free product of two nontrivial countable amenable discrete groups, where at least one of them has more than two elements, is primitive. We also show that in many cases, this C$^*$-algebra is…

Operator Algebras · Mathematics 2010-03-30 Erik Bédos , Tron Omland

The aim of this paper is to give a proof of the restriction theorems for principal bundles with a reductive algebraic group as structure group in arbitrary characteristic. Let $G$ be a reductive algebraic group over any field $k=\bar{k}$,…

Algebraic Geometry · Mathematics 2013-03-01 Sudarshan Gurjar

For a finite group $G$ denote by $\gamma(L(G))$ the genus of the subgroup graph of $G.$ We prove that $\gamma(L(G))$ tends to infinity as either the rank of $G$ or the number of prime divisors of $|G|$ tends to infinity.

Group Theory · Mathematics 2020-02-03 Andrea Lucchini
‹ Prev 1 4 5 6 7 8 10 Next ›