no code implementations • 4 Dec 2020 • Simona Bonvicini, Marco Buratti, Martino Garonzi, Gloria Rinaldi, Tommaso Traetta
In particular, there is no known congruence class representing the orders of a KTS with a number of automorphisms at least close to the number of points.
Combinatorics Group Theory 05B07, 20B25
1 code implementation • 28 Mar 2019 • Fabio Salassa, Gabriele Dragotto, Tommaso Traetta, Marco Buratti, Federico Della Croce
The Oberwolfach Problem $OP(F)$, posed by Gerhard Ringel in 1967, is a paradigmatic Combinatorial Design problem asking whether the complete graph $K_v$ decomposes into edge-disjoint copies of a $2$-regular graph $F$ of order $v$.
Combinatorics
