Tomaž Pisanski: Splittable and unsplittable graphs and configurations
Date of publication: 25. 5. 2016
Discrete mathematics seminar
Torek, 31. 5. 2016, od 10h do 12h, Plemljev seminar, Jadranska 19
Povzetek. We prove that there exists infinitely many splittable and also infinitely many unsplittable 3-configurations. We also present a study of small trivalent cyclic Haar graphs with respect to splittability.
This is work in progress with Nino Bašić, Jan Grošelj, Branko Grünbaum and Jaka Kranjc.