Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence
From MaRDI portal
Publication:2290353
DOI10.37236/8929zbMath1471.05046arXiv1908.01309OpenAlexW3003083692MaRDI QIDQ2290353
Tejas Iyer, Mikhail Isaev, Brendan D. McKay
Publication date: 27 January 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.01309
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic behavior of the number of Eulerian orientations of graphs
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
- Random regular tournaments
- MM algorithms for generalized Bradley-Terry models.
- Asymptotic enumeration of tournaments with a given score sequence
- On the number of Eulerian orientations of a graph
- Asymptotic enumeration of dense 0-1 matrices with specified line sums
- Isoperimetric numbers of graphs
- Majorization, entropy and paired comparisons
- An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
- Random dense bipartite graphs and directed graphs with specified degrees
- Maximal Flow Through a Network
- Solution of a Ranking Problem from Binary Comparisons
- The Ranking of Incomplete Tournaments: A Mathematician's Guide to Popular Sports
- Complex martingales and asymptotic enumeration
- Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph
- Degree sequences of random digraphs and bipartite graphs
This page was built for publication: Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence