ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Cn(T2k+1,B2k+1k⩾1)\mathcal{C}_{n}(\\{T_{2k+1},B_{2k+1}\\}_{k\geqslant 1}) be the set of connected chord diagrams of size nn 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 33-edge-connected rooted cubic maps with 2n2n 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.