Asymptotic Enumeration of Sparse Multigraphs with Given Degrees
| dc.contributor.author | Greenhill, Catherine | |
| dc.contributor.author | McKay, Brendan | |
| dc.date.accessioned | 2015-12-10T23:20:12Z | |
| dc.date.issued | 2013 | |
| dc.date.updated | 2015-12-10T10:21:22Z | |
| dc.description.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 | |
| dc.identifier.issn | 0895-4801 | |
| dc.identifier.uri | http://hdl.handle.net/1885/66223 | |
| dc.publisher | Society for Industrial and Applied Mathematics | |
| dc.source | SIAM Journal on Discrete Mathematics | |
| dc.title | Asymptotic Enumeration of Sparse Multigraphs with Given Degrees | |
| dc.type | Journal article | |
| local.bibliographicCitation.issue | 4 | |
| local.bibliographicCitation.lastpage | 2089 | |
| local.bibliographicCitation.startpage | 2064 | |
| local.contributor.affiliation | Greenhill, Catherine, University of New South Wales | |
| local.contributor.affiliation | McKay, Brendan, College of Engineering and Computer Science, ANU | |
| local.contributor.authoruid | McKay, Brendan, u8304521 | |
| local.description.embargo | 2037-12-31 | |
| local.description.notes | Imported from ARIES | |
| local.identifier.absfor | 080201 - Analysis of Algorithms and Complexity | |
| local.identifier.absseo | 970108 - Expanding Knowledge in the Information and Computing Sciences | |
| local.identifier.ariespublication | u4334215xPUB1245 | |
| local.identifier.citationvolume | 27 | |
| local.identifier.doi | 10.1137/130913419 | |
| local.identifier.scopusID | 2-s2.0-84891314799 | |
| local.identifier.thomsonID | 000328900800027 | |
| local.type.status | Published Version |
Downloads
Original bundle
1 - 1 of 1
Loading...
- Name:
- 01_Greenhill_Asymptotic_Enumeration_of_2013.pdf
- Size:
- 486.07 KB
- Format:
- Adobe Portable Document Format