BibTeX
CSL-JSON
MLA
Harvard
Splittable and unsplittable graphs and configurations
release_nnrzpgdz3jcdvoid5ho5wdx2ey
by
Nino Bašić,
Jan Grošelj,
Branko Grünbaum,
Tomaž
Pisanski
Released
as a article
.
2018
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öbius-Kantor configuration are
splittable.
In text/plain format
Archived Files and Locations
application/pdf
237.6 kB
file_y4yffjldefgabbt73bu4qg4ul4
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
1803.06568v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links