arXiv subjects

Shaofei Du

Publications and source records attributed to Shaofei Du.

17 recordsLinked to original sources

arXiv2026

Hamilton Cycles in Semisymmetric Graphs

In light of Lov\'{a}sz's longstanding question on the existence of Hamilton paths in vertex-transitive graphs, this paper considers a natural variant: what if vertex-transitivity is relaxed, yet a high degree of symmetry--specifically edge-transitivity--is retained? To investigate this, we focus on the class of semisymmetric graphs, which are regular, edge-transitive, but not vertex-transitive. In this paper, it will be shown that every connected semisymmetric graph of order $2pq$, where $p$ and $q$ are two distinct primes contains a Hamilton cycle and that every connected cubic semisymmetric graph of order less than 3000 contains a Hamilton cycle too. Based on these observations, the following question is posed: construct a connected semisymmetric graph which has no Hamilton cycle.

math.CO↗

arXiv2025

The Burness-Giudici Conjecture on Some Primitive Groups with Socle PSU(3,q)

Let $G$ be a transitive permutation group on $\Omega$ with two points $\alpha, \beta\in\Omega$ such that $G_{\alpha}\cap G_{\beta}=1$. The Saxl graph $\Sigma(G)$ of the pair $(G,\Omega)$ is the graph with vertex set $\Omega$, while two vertices $\alpha', \beta'$ are adjacent if and only if $G_{\alpha'}\cap G_{\beta'}=1$. It was conjectured by Burness and Giudici that the Saxl graph $\Sigma(G)$ of any primitive permutation group $G$ has the property that any two vertices have a common neighbor. We focused on proving the conjecture for all primitive groups $G$ whose socle is a simple group of Lie-type of rank $1$, that is, those with $soc(G)\in \{PSL(2,q), PSU(3,q), Ree(q), Sz(q)\}$. The case of $soc(G)=PSL(2,q)$ has been published in two papers. This paper will address most cases where $soc(G)=PSU(3,q)$, with the exception of a particularly intricate configuration in which the point stabilizer contains $PSO(3,q)$. That specific configuration has been treated in a separate paper.

math.GR↗

arXiv2025

The Burness-Giudici Conjecture on Primitive Groups with Socle PSU(3,q)

Let $G$ be a transitive permutation group on a set $\Omega$, and suppose $G_{\alpha}\cap G_{\beta}=1$ for some distinct $\alpha, \beta\in\Omega$. The Saxl graph $\Sigma(G)$ of $(G, \Omega)$ is defined as the graph with vertex set $\Omega$, where two vertices $\alpha', \beta'$ are adjacent if and only if $G_{\alpha'}\cap G_{\beta'}=1$. Burness and Giudici conjectured that for every primitive permutation group $G$, its Saxl graph has the property that any two vertices share a common neighbor. We focus on proving the conjecture for all primitive groups $G$ whose socle is a simple group of Lie-type of rank $1$; that is, $soc(G)\in \{PSL(2,q),PSU(3,q), Ree(q),Sz(q)\}$. The case $soc(G)=PSL(2,q)$ has been treated in two earlier papers. The purpose of the present paper is to settle the case $soc(G)=PSU(3,q)$. To finsh this work, we draw on methods from abstract- and permutation- group theory, finite unitary geometry, probabilistic approach, number theory (employing Weil's bound), and, most importantly, algebraic combinatorics, which provides us some key ideas.

math.GR↗

arXiv2025

The Burness-Giudici Conjecture on Primitive Groups with Socle $Ree(q)$ and $Sz(q)$

Let $G$ be a transitive permutation group on $\Omega$ containing two points $\alpha, \beta$ such that $G_{\alpha}\cap G_{\beta}=1$. The Saxl graph $\Sigma(G)$ of $(G, \Omega)$ is defined as the graph with vertex set $\Omega$, where two vertices $\alpha', \beta'$ are adjacent if and only if $G_{\alpha'}\cap G_{\beta'}=1$. Burness and Giudici conjectured that for any primitive permutation group $G$, its Saxl graph $\Sigma(G)$ satisfies the property that any two vertices share a common neighbor. We focused on proving this conjecture for all primitive groups $G$ whose socle is a simple group of Lie-type of rank $1$; that is, groups with $soc(G)\in \{PSL(2,q), PSU(3,q), Ree(q), Sz(q)\}$. The case $soc(G)=PSL(2,q)$ has been published in two papers. In this paper, we treat the cases where $soc(G)\in\{Ree(q), Sz(q)\}$.

math.GR↗

arXiv2024

On Hamilton paths in vertex-transitive graphs of order $10p$

It was shown by Kutnar, Maru\v si\v c and Zhang in 2012 that every connected vertex-transitive graph of order $10p$, where $p$ is a prime and $p\ne 7$, contains a Hamilton path, except for graphs $X$ arising from the action of PSL$(2, s^m)$ on cosets of $\mathbb{Z}_s^m\rtimes \mathbb{Z}_{\frac{s^m-1}{10}}$, where $s$ is a prime. In this paper, Hamilton cycles of these exceptions $X$ will be found.

math.CO↗

arXiv2024

Hamilton cycles in vertex-transitive graphs of order $6p$

It was shown by Kutnar and \v Sparl in 2009 that every connected vertex-transitive graph of order $6p$, where $p$ is a prime, contains a Hamilton path. In this paper, it will be shown that every such graph contains a Hamilton cycle, except for the triangle-replaced graph of the Petersen graph.

math.CO↗

arXiv2023

The Product of a Generalized Quaternion Group And a Cyclic Group

Let $X(Q)=QC$ be a group, where $Q$ is a generalized quaternion group and $C$ is a cyclic group such that $Q\cap C=1$. In this paper, $X(Q)$ will be characterized and moreover, a complete classification for that will be given, provided $C$ is core-free. For the reason of self-constraint, in this paper a classification of the group $X(D)=DC$ is also given, where $D$ is a dihedral group and $C$ is a cyclic group such that $D\cap C=1$ and $C$ is core-free. Remind that the group $X(D)$ was recently classified in [12], based on a number of papers on skew-morphisms of dihedral groups. In this paper, a different approach from that in [12] will be used.

math.GR↗

arXiv2022

Regular Cayley Maps of Elementary abelian $p$-groups: Classification and Enumeration

Recently, regular Cayley maps of cyclic groups and dihedral groups have been classified. A nature question is to classify regular Cayley maps of elementary abelian $p$-groups $Z_p^n$. In this paper, a complete classification of regular Cayley maps of $Z_p^n$ is given and moreover, the number of these maps and their genera are enumerated.

math.CO↗

arXiv2022

Skew-Morphisms of Elementary Abelian p-Groups

A skew-morphism of a finite group $G$ is a permutation $\sigma$ on $G$ fixing the identity element, and for which there exists an integer function $\pi$ on $G$ such that $\sigma(xy)=\sigma(x)\sigma^{\pi(x)}(y)$ for all $x,y\in G$. It has been known that given a skew-morphism $\sigma $ of $G$, the product of $\langle \sigma \rangle$ with the left regular representation of $G$ forms a permutation group on $G$, called the skew-product group of $\sigma$. In this paper, the skew-product groups of skew-morphisms of finite elementary abelian $p$-groups are investigated. Some properties, characterizations and constructions about that are obtained.

math.CO↗

arXiv2022

Hamilton Cycles In Primitive Graphs of Order $2rs$

After long term efforts, it was recently proved in \cite{DKM2} that except for the Peterson graph, every connected vertex-transitive graph of order $rs$ has a Hamilton cycle, where $r$ and $s$ are primes. A natural topic is to solve the hamiltonian problem for connected vertex-transitive graphs of $2rs$. This topic is quite trivial, as the problem is still unsolved even for that of $r=3$. In this paper, it is shown that except for the Coxeter graph, every connected vertex-transitive graph of order $2rs$ contains a Hamilton cycle, provided the automorphism group acts primitively on vertices.

math.CO↗

arXiv2022

Orientably-Regular $p$-Maps and Regular $p$-Maps

A map is called a {\it $p$-map} if it has a prime $p$-power vertices. An orientably-regular (resp. A regular ) $p$-map is called {\it solvable} if the group $G^+$ of all orientation-preserving automorphisms (resp. the group $G$ of automorphisms) is solvable; and called {\it normal} if $G^+$ (resp. $G$) contains the normal Sylow $p$-subgroup. In this paper, it will be proved that both orientably-regular $p$-maps and regular $p$-maps are solvable and except for few cases that $p\in \{2, 3\}$, they are normal. Moreover, nonnormal $p$-maps will be characterized and some properties and constructions of normal $p$-maps will be given.

math.CO↗

arXiv2020

On the Burness-Giudici Conjecture

Let $G$ be a permutation group on a set $\Omega$. A subset of $\Omega$ is a base for $G$ if its pointwise stabilizer in $G$ is trivial. By $b(G)$ we denote the size of the smallest base of $G$. Every permutation group with $b(G)=2$ contains some regular suborbits. It is conjectured by Burness-Giudici in [4] that every primitive permutation group $G$ with $b(G)=2$ has the property that if $\alpha^g\not\in \Gamma$ then $\Gamma \cap \Gamma^g\neq \emptyset$, where $\Gamma$ is the union of all regular suborbits of $G$ relative to $\alpha$. An affirmative answer of the conjecture has been shown for many sporadic simple groups and some alternative groups in [4], but it is still open for simple groups of Lie-type. The first candidate of infinite family of simple groups of Lie-type we should work on might be $PSL(2,q)$, where $q\geq 5$. In this manuscript, we show the correctness of the conjecture for all the primitive groups with socle $PSL(2,q)$, see Theorem $1.3$.

math.CO↗

arXiv2019

Skew-morphisms of nonabelian characteristically simple groups

A skew-morphism of a finite group $G$ is a permutation $\s$ on $G$ fixing the identity element, and for which there exists an integer function $\pi$ on $G$ such that $\s(xy)=\s(x)\s^{\pi(x)}(y)$ for all $x,y\in G$. It has been known that given a skew-morphism $\s $ of $G$, the product of $\lg \s \rg$ with the left regular representation of $G$ forms a permutation group on $G$, called the skew-product group of $\s$. The skew-morphism was introduced as an algebraic tool to investigate regular Cayley maps. In this paper, the skew-product groups are characterized, for all skew-morphisms of finite nonabelian characteristically simple groups (see Theorem 1.1) and correspondingly the Cayley maps on these groups are characterized (see Theorem 1.5).

math.CO↗

arXiv2018

Hamilton cycles in vertex-transitive graphs of order a product of two primes

A step forward is made in a long standing Lov\'{a}sz's problem regarding hamiltonicity of vertex-transitive graphs by showing that every connected vertex-transitive graph of order a product of two primes, other than the Petersen graph, contains a Hamilton cycle. Essential tools used in the proof range from classical results on existence of Hamilton cycles, such as Chv\'atal's theorem and Jackson's theorem, to certain results on polynomial representations of quadratic residues at primitive roots in finite fields.

math.CO↗

arXiv2012

A Classification of Orientable Regular Embeddings of Complete Multipartite Graphs

Let $K_{m[n]}$ be the complete multipartite graph with $m$ parts, while each part contains $n$ vertices. The orientably-regular embeddings of complete graphs $K_{m[1]}$ have been determined by Biggs (1971) \cite{Big1}, James and Jones (1985) \cite{JJ}. During the past twenty years, several papers such as Du et al.(2007, 2010) \cite{DJKNS1,DJKNS2}, Jones et al. (2007, 2008) \cite{JNS1,JNS2}, Kwak and Kwon (2005, 2008) \cite{KK1,KK2} and Nedela et al. (1997, 2002)\cite{NS,NSZ} contributed to the orientably-regular embeddings of complete bipartite graphs $K_{2[n]}$ and the final classification was given by Jones \cite{Jon1} in 2010. Based on our former paper \cite{ZD}, this paper gives a complete classification of orientably-regular embeddings of graphs $K_{m[n]}$ for the general cases $m\ge 3$ and $n\ge 2$.

math.CO↗

arXiv2012

Semisymmetric graphs of order $2p^3$

A simple undirected graph is said to be {\em semisymmetric} if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. It was proved in [{\em J. Combin. Theory Ser. B} {\bf 3}(1967), 215-232] that there exist no semisymmetric graphs of order $2p$ and $2p^2$, where $p$ is a prime. The classification of semisymmetric graphs of order $2pq$ was given in [{\em Comm. in Algebra} {\bf 28}(2000), 2685-2715], for any distinct primes $p$ and $q$. Our long term goal is to determine all the semisymmetric graphs of order $2p^3$, for any prime $p$. All these graphs $\G$ are divided into two subclasses: (I) $\Aut(\G)$ acts unfaithfully on at least one bipart; and (II) $\Aut(\G)$ acts faithfully on both biparts. This paper gives a group theoretical characterization for Subclass (I) and based on this characterization, we shall give a complete classification for this subclass in our further research.

math.CO↗

arXiv2011

2-Groups that factorise as products of cyclic groups, and regular embeddings of complete bipartite graphs

We classify those 2-groups G which factorise as a product of two disjoint cyclic subgroups A and B, transposed by an automorphism of order 2. The case where G is metacyclic having been dealt with elsewhere, we show that for each e>2 there are exactly three such non-metacyclic groups G with $|A|=|B|=2^e$, and for e=2 there is one. These groups appear in a classification by Berkovich and Janko of 2-groups with one non-metacyclic maximal subgroup; we enumerate these groups, give simpler presentations for them, and determine their automorphism groups.

math.GR↗