Conjecture on embeddings of graphs in
Conjecture on embeddings of graphs in
Let and let be a graph in , the class of two-terminal graphs associated with alternating embeddings on the surface . Then embeds in .
Embedding conjecture. Every graph embeds in .
The preceding results show that if such a graph does not embed in , then it is an obstruction for and has an -alternating embedding in . The authors describe this exceptional scenario as quite unlikely; whether it can occur remains open.
Sources & referencesView supporting material
Primary source
Bojan Mohar and Petr Škoda, “Obstructions for two-vertex alternating embeddings of graphs in surfaces”, arXiv:1112.0800 (2011).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.