Asymptotic Enumeration of Sparse Multigraphs with Given Degrees

DOI10.1137/130913419zbMath1285.05093arXiv1303.4218OpenAlexW2594080620MaRDI QIDQ5408610

Brendan D. McKay, Catherine Greenhill

Publication date: 10 April 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.4218

zbMATH Keywords

multigraphasymptotic enumerationsymmetric matrixswitchinginteger matrix

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Asymptotic enumeration (05A16) Contingency tables (62H17) Matrices of integers (15B36)

Related Items (6)

Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees ⋮ An algebraic approach to FQHE variational wave functions ⋮ Threshold functions for small subgraphs in simple graphs and multigraphs ⋮ An algebraic approach to electron interactions in quantum Hall systems ⋮ Asymptotic enumeration of linear hypergraphs with given number of vertices and edges ⋮ Uniform Generation of Random Regular Graphs

Uses Software

• RAG

This page was built for publication: Asymptotic Enumeration of Sparse Multigraphs with Given Degrees