Asymptotic Enumeration of Eulerian Circuits in the Complete Graph

DOI10.1017/S0963548398003642zbMath0916.05048OpenAlexW2121163052MaRDI QIDQ4238173

Brendan D. McKay, Robert W. Robinson

Publication date: 7 July 1999

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548398003642

zbMATH Keywords

directed graphtournamentEulerian circuit

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Asymptotic enumeration (05A16) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Asymptotic behavior of the number of Eulerian orientations of graphs ⋮ The number of Euler tours of random directed graphs ⋮ Semi-restricted rock, paper, scissors ⋮ Exact counting of Euler tours for generalized series-parallel graphs ⋮ Subgraphs of Dense Random Graphs with Specified Degrees ⋮ Asymptotic enumeration of dense 0-1 matrices with specified line sums ⋮ Random dense bipartite graphs and directed graphs with specified degrees ⋮ The genus of complete 3-uniform hypergraphs

This page was built for publication: Asymptotic Enumeration of Eulerian Circuits in the Complete Graph