加载中…
Archdeacon, in his seminal paper , defined the concept of Heffter array to provide explicit constructions of biembeddings of the complete graph into orientable surfaces, the so-called Archdeacon embeddings, and proved that these embeddings are -regular. In this paper, we show that an Archdeacon embedding may admit an automorphism group that is strictly larger than . Indeed, as an application of the interesting class of arrays recently introduced by Buratti in , we exhibit, for infinitely many values of , an embedding of this type having full automorphism group of size that is the largest possible one.

生成讲解博客的中文版本

生成AI智能校验的中文版本