Splittable and unsplittable graphs and configurations
Combinatorics
2018-08-24 v1
Abstract
We prove that there exist infinitely many splittable and also infinitely many unsplittable cyclic 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.
Keywords
Cite
@article{arxiv.1803.06568,
title = {Splittable and unsplittable graphs and configurations},
author = {Nino Bašić and Jan Grošelj and Branko Grünbaum and Tomaž Pisanski},
journal= {arXiv preprint arXiv:1803.06568},
year = {2018}
}
Comments
19 pages, 10 figures