Autor:	de Panafieu, Élie, Ramos, Lander
Rok vydání:	2015
Předmět:	Mathematics - Combinatorics
Druh dokumentu:	Working Paper
Popis:	Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs with a given minimum degree, and establishes new ones, such as the enumeration of Euler graphs, i.e. where all vertices have an even degree. Those results are derived using analytic combinatorics. Comment: 10 pages, 7 pages of appendix, 1 figure
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1506.03061 Zobrazit plný text záznamu View this record from Arxiv