Asymptotic enumeration of digraphs and bipartite graphs by degree sequence
From MaRDI portal
Publication:6074864
DOI10.1002/rsa.21105zbMath1522.05012arXiv2006.15797OpenAlexW3037707435MaRDI QIDQ6074864
Nicholas C. Wormald, Anita Liebenau
Publication date: 19 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.15797
Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The enumeration of arrays and a generalization related to contingency tables
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
- The number of matchings in random regular graphs and bipartite graphs
- The asymptotic number of non-negative integer matrices with given row and column sums
- Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums
- Transversal theory. An account of some aspects of combinatorial mathematics
- Asymptotic enumeration of dense 0-1 matrices with specified line sums
- The asymptotic number of integer stochastic matrices
- Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
- Random dense bipartite graphs and directed graphs with specified degrees
- Some problems in the enumeration of labelled graphs
- The degree sequence of a random graph. I. The models
- Complex martingales and asymptotic enumeration
- The number of graphs and a random graph with a given degree sequence
- Asymptotics and random matrices with row-sum and column sum-restrictions
- Degree sequences of random digraphs and bipartite graphs