<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.upr.si/IzpisGradiva.php?id=17632"><dc:title>Splittable and unsplittable graphs and configurations</dc:title><dc:creator>Bašić,	Nino	(Avtor)
	</dc:creator><dc:creator>Grošelj,	Jan	(Avtor)
	</dc:creator><dc:creator>Grünbaum,	Branko	(Avtor)
	</dc:creator><dc:creator>Pisanski,	Tomaž	(Avtor)
	</dc:creator><dc:subject>configuration of points and lines</dc:subject><dc:subject>unsplittable configuration</dc:subject><dc:subject>unsplittable graph</dc:subject><dc:subject>independent set</dc:subject><dc:subject>Levi graph</dc:subject><dc:subject>Grünbaum graph</dc:subject><dc:subject>splitting type</dc:subject><dc:subject>cyclic Haar graph</dc:subject><dc:description>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.</dc:description><dc:date>2019</dc:date><dc:date>2022-01-03 19:04:23</dc:date><dc:type>Neznano</dc:type><dc:identifier>17632</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
