collaborators

6 papers

math.GR2026

Forcible groups and Frattini covers

Sean Eberhard, Robert M. Guralnick, Carl Schildkraut +1

We say that a finite group *forces* a finite group if every finite cover of contains a subgroup isomorphic to , and we say is *forcible* if some finite group …

math.GR2026

Fixed-point-free elements in two-orbit permutation groups

Jessica Anzanello, Sean Eberhard

Let be a two-orbit permutation group on points. We show that contains either a derangement or an element of prime-power order with a unique fixed point. As a coroll…

math.GR2026

Diameter bounds for arbitrary finite groups and applications

Sean Eberhard, Elena Maini, Luca Sabatini +1

We prove a strong general-purpose bound for the diameter of a finite group depending only on the diameters of its composition factors and the maximal exponent of a normal abelian s…

math.GR2026

Expanding groups with large diameter

Sean Eberhard, Luca Sabatini

We study how the spectral gap and diameter of Cayley graphs depend strongly on the choice of generating set. We answer a question of Pyber and Szabó (2013) by exhibiting a sequence…

math.CO2025

Examples of diameter-2 graphs with no triangle or

Sean Eberhard, Vladislav Taranchuk, Craig Timmons

For each let denote the class of graphs other than stars that have diameter and contain neither a triangle nor a . The famous Hoffman--Singleton Theore…

math.GR2025

Probabilistic construction of some extremal -groups

Sean Eberhard, Luca Sabatini

A -group is called *ab-maximal* if for every proper subgroup of . Similarly, is called *-maximal* if for every proper subgrou…