Abstract
This article aims to provide exponential lower bounds on the number of non-isomorphic -gonal biembeddings of the complete multipartite graph into orientable surfaces. For this purpose, we use the concept, introduced by Archdeacon in 2015, of Heffer array and its relations with graph embeddings. In particular we show that, under certain hypotheses, from a single Heffter array, we can obtain an exponential number of distinct graph embeddings. Exploiting this idea starting from the arrays constructed by Cavenagh, Donovan and Yazici in 2020, we obtain that, for infinitely many values of and , there are at least non-isomorphic -gonal biembeddings of , where is the binary entropy. Moreover about the embeddings of , for , we provide a construction of non-isomorphic -gonal biembeddings whenever is odd and belongs to a wide infinite family of values.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.