The asymptotic numbers of regular tournaments,Eulerian digraphs and Eulerian oriented graphs |
| |
| Authors: | Brendan D. McKay |
| |
| Affiliation: | (1) Computer Science Department, Australian National University, GPO Box 4, 2601, ACT, Australia |
| |
| Abstract: | LetRT(n), ED(n) andEOG(n) be the number of labelled regular tournaments, labelled loop-free simple Eulerian digraphs, and labelled Eulerian oriented simple graphs, respectively, onn vertices. Then, asn  , , for any >0. The last two families of graphs are also enumerated by their numbers of edges. The proofs use the saddle point method applied to appropriaten-dimensional integrals. |
| |
| Keywords: | 05 C 30 05 C 20 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
