ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For every nonnegative integer ii and graph GG, let cri(G)cr_i(G) and cr~i(G)\tilde{cr}_i(G) denote the minimum numbers of crossings in drawings of GG on the orientable and nonorientable surfaces of genus ii, respectively. The resulting finite sequences are the orientable and nonorientable crossing sequences.

Archdeacon, Bonnington, and Širáň's conjecture. If (a1,a2,…,0)(a_1,a_2,\ldots,0) is a sequence of integers which strictly decreases until 00, then there is a graph whose crossing sequence (nonorientable crossing sequence) is (a1,a2,…,0)(a_1,a_2,\ldots,0).

Strict decrease until the terminal zero is necessary because a crossing can be removed by adding a handle or crosscap. The conjecture asserts that this necessary condition is also sufficient for both orientable and nonorientable crossing sequences; its resolution is not established by the supplied source.

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.