首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Asymptotic enumeration and limit laws for graphs of fixed genus
Authors:Guillaume Chapuy  Éric Fusy  Omer Giménez  Marc Noy
Institution:a Dept. Mathematics, Simon Fraser University, 8888 University Drive, Burnaby, BC, V5A 1S6, Canada
b Laboratoire d'Informatique de l'École Polytechnique, 91128 Palaiseau Cedex, France
c Dept. de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Jordi Girona 1-3, 08034 Barcelona, Spain
d Dept. de Matemàtica Aplicada II, Universitat Politècnica de Catalunya, Jordi Girona 1-3, 08034 Barcelona, Spain
Abstract:It is shown that the number of labelled graphs with n vertices that can be embedded in the orientable surface Sg of genus g grows asymptotically like
c(g)n5(g−1)/2−1γnn!
Keywords:Graph embeddings  Enumeration  Generating functions  Limit laws
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号