The classification conjecture for unsplittable cyclic (n_3) configurations
Statement
A cyclic configuration is a configuration whose Levi graph is a cyclic Haar graph; write for the Haar graph associated with the integer and connection set . The configuration is unsplittable when it is neither point-splittable nor line-splittable.
Classification conjecture. A cyclic configuration is unsplittable if and only if its Levi graph belongs to one of the following three infinite families:
- for ;
- for ;
- for where .
The conjecture is motivated by the known results on splittability of cyclic Haar graphs and by experimental evidence, but the classification of all remaining cyclic configurations is left open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.