Archdeacon, Bonnington, and Širáň's crossing sequence conjecture
Statement
For every nonnegative integer and graph , let and denote the minimum numbers of crossings in drawings of on the orientable and nonorientable surfaces of genus , respectively. The resulting finite sequences are the orientable and nonorientable crossing sequences.
Archdeacon, Bonnington, and Širáň's conjecture. If is a sequence of integers which strictly decreases until , then there is a graph whose crossing sequence (nonorientable crossing sequence) is .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.