English
Related papers

Related papers: Non-solvable $2$-arc-transitive covers of Petersen…

200 papers

The intersection graph of a group $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two distinct vertices $H$…

Group Theory · Mathematics 2016-08-03 Selçuk Kayacan

A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. In this paper we present a complete classification of all…

Combinatorics · Mathematics 2019-11-13 Heather A. Newman , Hector Miranda , Darren A. Narayan

We classify non-complete prime valency graphs satisfying the property that their automorphism group is transitive on both the set of arcs and the set of $2$-geodesics. We prove that either $\Gamma$ is 2-arc transitive or the valency $p$…

Combinatorics · Mathematics 2015-04-20 Alice Devillers , Wei Jin , Cai Heng Li , Cheryl E. Praeger

A finite transitive permutation group is elusive if it contains no derangements of prime order. These groups are closely related to a longstanding open problem in algebraic graph theory known as the Polycirculant Conjecture, which asserts…

Group Theory · Mathematics 2026-03-19 Jiyong Chen , Melissa Lee , Dorde Mitrovic , E. A. O'Brien , Binzhou Xia

A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not its arc set. In this paper, we study all tetravalent half-arc-transitive graphs of order $12p$.

Combinatorics · Mathematics 2022-06-01 M. Ghasemi , A. A. Talebi , N. Mehdipoor

We consider two possible extensions of a theorem of Thomassen characterizing the graphs admitting a 2-vertex-connected orientation. First, we show that the problem of deciding whether a mixed graph has a 2-vertex-connected orientation is…

Combinatorics · Mathematics 2022-03-02 Florian Hörsch , Zoltán Szigeti

Let G be a finite group. Denoting by cd(G) the set of degrees of the irreducible complex characters of G, we consider the character degree graph of G: this is the (simple undirected) graph whose vertices are the prime divisors of the…

Group Theory · Mathematics 2022-09-16 Silvio Dolfi , Emanuele Pacifici , Lucia Sanus , Victor Sotomayor

Let $G$ be a finite group. Denoting by ${\rm{cd}}(G)$ the set of the degrees of the irreducible complex characters of $G$, we consider the {\it character degree graph} of $G$: this is the (simple, undirected) graph whose vertices are the…

Group Theory · Mathematics 2022-09-16 S. Dolfi , E. Pacifici , L. Sanus

We introduce the notion of a symmetric basis of a vector space equipped with a quadratic form, and provide a sufficient and necessary condition for the existence to such a basis. Symmetric bases are then used to study Cayley graphs of…

Combinatorics · Mathematics 2019-05-08 Michael Giudici , Cai Heng Li , Yian Xu

It is well-known that every sharply 2-transitive group of characteristic 3 splits. Here we construct the first examples of non-split sharply 2-transitive groups in odd positive characteristic $p$, for sufficiently large primes $p$.…

Group Theory · Mathematics 2023-12-29 Marco Amelio , Simon André , Katrin Tent

Each group G of nxn permutation matrices has a corresponding permutation polytope, P(G):=conv(G) in R^{nxn}. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then…

Combinatorics · Mathematics 2007-05-23 Robert Guralnick , David Perkinson

The fact that the adjacency matrix of every finite graph is diagonalizable plays a fundamental role in spectral graph theory. Since this fact does not hold in general for digraphs, it is natural to ask whether it holds for digraphs with…

Combinatorics · Mathematics 2023-09-13 Yuxuan Li , Binzhou Xia , Sanming Zhou , Wenying Zhu

We determine a lower bound for the number of edges of a 2-connected maximal nontraceable graph, and present a construction of an infinite family of maximal nontraceable graphs that realize this bound.

Combinatorics · Mathematics 2007-05-23 Marietjie Frick , Joy Singleton

Given two 2 disjoint vertex-sets $S=\{u,x\}$ and $T=\{v,y\}$, a paired many-to-many 2-disjoint path cover joining S and T, is a set of two vertex-disjoint paths with endpoints $u,v$ and $x,y$, respectively, that cover every vertex of the…

Combinatorics · Mathematics 2025-07-22 Jinhao Liu , Huazhong Lü

A graph is called {\em arc-transitive} (or {\em symmetric}) if its automorphism group has a single orbit on ordered pairs of adjacent vertices, and 2-arc-transitive its automorphism group has a single orbit on ordered paths of length 2. In…

Group Theory · Mathematics 2014-09-30 Marston D. E. Conder , Cai-Heng Li , Primoz Potocnik

In this paper, we study arc-transitive Cayley graphs on non-abelian simple groups with soluble stabilizers and valency seven. Let $\Ga$ be such a Cayley graph on a non-abelian simple group $T$. It is proved that either $\Ga$ is a normal…

Combinatorics · Mathematics 2017-08-01 Jiangmin Pan , Fugang Yin , Bo Ling

Let $P$ be a Poisson structure on a finite-dimensional affine real manifold. Can $P$ be deformed in such a way that it stays Poisson? The language of Kontsevich graphs provides a universal approach -- with respect to all affine Poisson…

Combinatorics · Mathematics 2018-02-20 Ricardo Buring , Arthemy V. Kiselev , Nina Rutten

Given a finite connected simple graph $\Gamma$, and a subgroup $G$ of its automorphism group, a general method for finding all finite abelian regular coverings of $\Gamma$ that admit a lift of each element of $G$ is developed. As an…

Combinatorics · Mathematics 2024-02-27 Haimiao Chen , Hao Shen

We construct here the first known examples of non-split sharply 2-transitive groups of bounded exponent in odd positive characteristic for every large enough prime $p \equiv 3 \pmod{4}$. In fact, we show that there are countably many…

Group Theory · Mathematics 2025-09-17 Marco Amelio

By considering appropriate finite covering spaces of closed non-orientable surfaces, we construct linear representations of their mapping class group which have finite index image in certain big arithmetic groups.

Geometric Topology · Mathematics 2014-02-20 Ferit Deniz , Wilhelm Singhof