Notices of the International Congress of Chinese Mathematicians
Volume 4 (2016)
Strong embeddings and $2$-isomorphism
Pages: 5 – 13
We present two conjectures related to strong embeddings of a graph into a surface. The first conjecture relates equivalence of integer quadratic forms given by the Laplacians of graphs, $2$-isomorphism of $2$-connected graphs, and strong embeddings of graphs. We prove various special cases of this conjecture, and give evidence for it. The second conjecture, motivated by ideas from physics and number theory, gives a lower bound on the number of strong embeddings of a graph. If true, this conjecture would imply the well-known Strong Embedding Conjecture.
Published 7 April 2017