3 papers
math.CO2024
The diameter of random Schreier graphs
Daniele Dona, Luca Sabatini
We give a combinatorial proof of the following theorem. Let be any finite group acting transitively on a set of cardinality . If is a random set of size ,…
math.GR2018
Towards a CFSG-free diameter bound for
Daniele Dona
Helfgott and Seress have proved the existence of a quasipolynomial upper bound on the diameter of . In this paper, we walk partway towards removing the dependence…
math.CO2017
The Weisfeiler-Leman algorithm and the diameter of Schreier graphs
Daniele Dona
We prove that the number of iterations taken by the Weisfeiler-Leman algorithm for configurations coming from Schreier graphs is closely linked to the diameter of the graphs themse…