Asymptotic enumeration of tournaments with a given score sequence

Journal of Combinatorial Theory. Series A

Volumn 73, Issue 1, 1996, Pages 77-90

  McKay, Brendan D ^a   Wang, Xiaoji ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0029692641     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.1996.0003     Document Type: Article

References (7)

1. 1. W. FELLER, "An Introduction to Probability Theory and Its Applications," Vol.2, Wiley, New York, 1966.
2. 2. Z. C. GAO AND X. WANG, Asymptotic enumeration of tournaments containing a specified subgraph, submitted for publication.
3. 3. B. D. MCKAY, The asymptotic number of regular tournaments, eulerian digraphs and eulerian oriented graphs, Combinatorica 10, No. 4 (1990), 367-377.
4. 4. B. D. MCKAY AND R. W. ROBINSON, Asymptotic enumeration of eulerian circuits in the complete graph, submitted for publication.
5. 5. B. D. MCKAY AND N. C. WORMALD, Asymptotic enumeration by degree sequence of graphs of high degree, European J. Combin. 11 (1990), 565-580.
6. 6. J. H. SPENCER, Random regular tournaments, Period. Math. Hungar. 5 (1974), 105-120.
7. 7. X. WANG, Asymptotic enumeration of bipartite graphs, tournaments, digraphs and Eulerian digraphs with multiple edges, Ph.D. Australian National University, June 1991.