The cubic-map enumeration conjecture for bipartite chord diagrams
Statement
Let be the set of connected chord diagrams of size avoiding all odd top and bottom cycles. The cubic-map enumeration conjecture. The cardinality of this set equals the cardinality of the set of all -edge-connected rooted cubic maps with vertices and a distinguished Hamiltonian cycle. The proposed correspondence connects bipartite chord diagrams with a natural class of cubic maps; the source gives no proof, so the conjecture remains 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.