A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Splittable and unsplittable graphs and configurations
2018
Ars Mathematica Contemporanea
We prove that there exist infinitely many splittable and also infinitely many unsplittable cyclic (n_3) configurations. We also present a complete study of trivalent cyclic Haar graphs on at most 60 vertices with respect to splittability. Finally, we show that all cyclic flag-transitive configurations with the exception of the Fano plane and the Möbius-Kantor configuration are splittable.
doi:10.26493/1855-3974.1467.04b
fatcat:3tmzfatiandobb4cewi5nmnbky