by Op|EpG1 q||EpG2 q|q, where the constant in the Op¨q is independent of the genus.
Statement
by Op|EpG1 q||EpG2 q|q, where the constant in the Op¨q is independent of the genus. The best known bound on this general problem is Opg|EpG1 q||EpG2 q|q, also due to Negami [12]. See also [1] and [14] for more results around this conjecture. In this talk, I first presented a recent result obtained with Niloufar Fuladi and Alfredo Hubard [4], where we proved an analogue of the orientable theorem of [9] in the case of non-orientable surfaces, for the non-orientable canonical system of loops a1 a1 . . . ag ag : Theorem 1. There exists a polynomial time algorithm that, given a graph cellu- larly embedded on a non-orientable surface, computes a non-orientable canonical system of loops such that each loop in the system intersects any edge of the graph in at most 30 points.
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.