Splittable and unsplittable graphs and configurations

Authors

  • Nino Bašić University of Primorska, Slovenia
  • Jan Grošelj University of Ljubljana, Slovenia
  • Branko Grünbaum University of Washington, United States
  • Tomaž Pisanski University of Primorska, Slovenia and IMFM, Slovenia

DOI:

https://doi.org/10.26493/1855-3974.1467.04b

Keywords:

Configuration of points and lines, unsplittable configuration, unsplittable graph, independent set, Levi graph, Grünbaum graph, splitting type, cyclic Haar graph

Abstract

We prove that there exist infinitely many splittable and also infinitely many unsplittable cyclic (n3) 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.

Downloads

Published

2018-08-21

Issue

Vol. 16 No. 1 (2019)

Section

Articles

License

Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/