Splittable and unsplittable graphs and configurations
classification
🧮 math.CO
keywords
configurationscyclicsplittablegraphsinfinitelymanyunsplittablecomplete
read the original abstract
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\"obius-Kantor configuration are splittable.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.