Asymptotic Enumeration of Eulerian circuits in the Complete Graph

McKay, Brendan; Robinson, Robert W

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Asymptotic Enumeration of Eulerian circuits in the Complete Graph

Date

1998

Authors

McKay, Brendan

Robinson, Robert W

Publisher

Cambridge University Press

Abstract

We determine the asymptotic behaviour of the number of Eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, constrained to use each edge at most once, is taken on Kn, then the probability that all the edges are eventually used is asymptotic to e3/4n-1/2. Some similar results are obtained about Eulerian circuits and spanning trees in random regular tournaments. We also give exact values for up to 21 nodes.

URI

http://hdl.handle.net/1885/18794

Collections

ANU Research Publications

Source

Combinatorics Probability and Computing

Type

Journal article

Full item page

Cultural advice

Asymptotic Enumeration of Eulerian circuits in the Complete Graph

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Keywords

Citation

URI

Collections

Source

Type

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until