1 problem

The classification conjecture for unsplittable cyclic $(n_3)$ configurations
Classification conjecture. A cyclic $(n_3)$ configuration is unsplittable if and only if its Levi graph belongs to one of the following three infinite families:
openconfigurations graph-theory haar-graphs
0 responses
06

The classification conjecture for unsplittable cyclic (n3)(n_3)(n3​) configurations