2000 character limit reached
Constructions of bipartite and bipartite-regular hypermaps
Published 15 Sep 2011 in math.CO | (1109.3490v1)
Abstract: A hypermap is bipartite if its set of flags can be divided into two parts A and B so that both A and B are the union of vertices, and consecutive vertices around an edge or a face are contained in alternate parts. A bipartite hypermap is bipartite-regular if its set of automorphisms is transitive on A and on B. In this paper we see some properties of the constructions of bipartite hypermaps described algebraically by Breda and Duarte which generalize the construction induced by the Walsh representation of hypermaps. As an application we show that all surfaces have bipartite-regular hypermaps.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.