Cairns–Nikolayevsky thrackle conjecture for orientable surfaces
Statement
Let be a compact orientable surface of genus , and let be a graph with vertices and edges. Cairns–Nikolayevsky's conjecture. If can be thrackled on , then
Odd cycles and recursive constructions provide examples with edges, motivating this proposed maximum. The paper states that this conjecture is disproved by constructions with substantially more edges, so the claim is not 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.