Skip navigation
Skip navigation

Asymptotic Enumeration of Sparse Multigraphs with Given Degrees

Greenhill, Catherine; McKay, Brendan

Description

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

CollectionsANU Research Publications
Date published: 2013
Type: Journal article
URI: http://hdl.handle.net/1885/66223
Source: SIAM Journal on Discrete Mathematics
DOI: 10.1137/130913419

Download

File Description SizeFormat Image
01_Greenhill_Asymptotic_Enumeration_of_2013.pdf486.07 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator