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 Sparse Multigraphs with Given Degrees

Thumbnail Image

Date

2013

Authors

Greenhill, Catherine
McKay, Brendan

Journal Title

Journal ISSN

Volume Title

Publisher

Society for Industrial and Applied Mathematics

Abstract

Let J and J be subsets of N such that 0, 1 J and 0 J. For infinitely many n, let k = (k1, . . . , kn) be a vector of nonnegative integers whose sum M is even. We find an asymptotic expression for the number of multigraphs on the vertex set {1, . . . ,n} w

Description

Keywords

Citation

URI

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

Collections

ANU Research Publications

Source

SIAM Journal on Discrete Mathematics

Type

Journal article

Book Title

Entity type

Access Statement

License Rights

DOI

10.1137/130913419

Restricted until

2037-12-31

Downloads

File
Description
01_Greenhill_Asymptotic_Enumeration_of_2013.pdf (486.07 KB)

DSpace software copyright © 2002-2026 LYRASIS

abcd