On the local genus distribution of graph embeddings
From MaRDI portal
Publication:4977504
zbMATH Open1371.05128arXiv1601.02574MaRDI QIDQ4977504FDOQ4977504
Authors: Ricky X. F. Chen, Christian M. Reidys
Publication date: 16 August 2017
Abstract: The -cell embeddings of graphs on closed surfaces have been widely studied. It is well known that (-cell) embedding a given graph on a closed orientable surface is equivalent to cyclically ordering the edges incident to each vertex of . In this paper, we study the following problem: given a genus embedding of the graph and a vertex of , how many different ways of reembedding the vertex such that the resulting embedding is of genus ? We give formulas to compute this quantity and the local minimal genus achieved by reembedding. In the process we obtain miscellaneous results. In particular, if there exists a one-face embedding of , then the probability of a random embedding of to be one-face is at least , where denotes the vertex degree of . Furthermore we obtain an easy-to-check necessary condition for a given embedding of to be an embedding of minimum genus.
Full work available at URL: https://arxiv.org/abs/1601.02574
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)
Cited In (6)
- Distribution of embeddings
- Asymptotics of local face distributions and the face distribution of the complete graph
- A versatile combinatorial approach of studying products of long cycles in symmetric groups
- Combinatorially refine a Zagier-Stanley result on products of permutations
- 2-cell embeddings with prescribed face lengths and genus
- Plane permutations and applications to a result of Zagier-Stanley and distances of permutations
This page was built for publication: On the local genus distribution of graph embeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4977504)