Eric Swartz

On the covering number of small symmetric groups and some sporadic simple groups

Abstract A set of proper subgroups is a cover for a group if its union is the whole group. The minimal number of subgroups needed to cover G is called the covering number of G, denoted by σ ⁢ ( G )

On the covering number of symmetric groups having degree divisible by six

{\sigma(G)}

The locally 2-arc transitive graphs admitting an almost simple group of Suzuki type

. Determining σ ⁢ ( G )

Notes: A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth

{\sigma(G)}

A note on the girth-doubling construction for polygonal graphs

is an open problem for many nonsolvable groups. For symmetric groups S n

On 2-arc-transitive graphs of order kpn

{S_{n}}

A note on relative hemisystems of Hermitian generalised quadrangles

, Maróti determined σ ⁢ ( S n )

AS-configurations and skew-translation generalised quadrangles

{\sigma(S_{n})}

A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary even girth

for odd n with the exception of n = 9

On the covering number of S14

{n=9}