Unsplittability conjecture for cyclic configurations of rank at least four

From papers

A cyclic (nk)(n_k) configuration is a cyclic configuration in which every point lies on kk lines and every line contains kk points. Unsplittability conjecture. All cyclic (nk)(n_k) configurations for k4k \geq 4 are unsplittable.

The claim is motivated by the fact that no splittable cyclic (nk)(n_k) configuration with k4k \geq 4 was obtained, despite constructions of geometric point- and line-splittable configurations for every kk.

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

No solutions have been posted yet.