Unsplittability conjecture for cyclic configurations of rank at least four
Unsplittability conjecture for cyclic configurations of rank at least four
A cyclic configuration is a cyclic configuration in which every point lies on lines and every line contains points. Unsplittability conjecture. All cyclic configurations for are unsplittable.
The claim is motivated by the fact that no splittable cyclic configuration with was obtained, despite constructions of geometric point- and line-splittable configurations for every .
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Nino Bašić, Jan Grošelj, Branko Grünbaum and Tomaž Pisanski, “Splittable and unsplittable graphs and configurations”, arXiv:1803.06568 (2018).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.