Majorization and the number of bipartite graphs for given vertex degrees
From MaRDI portal
Publication:5135453
DOI10.22108/toc.2017.21469zbMath1463.05285OpenAlexW2738212233MaRDI QIDQ5135453
Publication date: 20 November 2020
Full work available at URL: https://doaj.org/article/e369ffb60e984ebdb907d65be599b7c7
Gale-Ryser theorembigraphic sequencebipartite realisation problemcontingency tables with fixed marginsmatrices with fixed row and column sums
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extension of Brualdi's algorithm for the construction of \((0,1)\)-matrices with prescribed row and column sum vectors
- Matrices with prescribed row and column sums
- A theorem on flows in networks
- Algorithms for constructing \((0,1)\)-matrices with prescribed row and column sum vectors
- On (0, 1)-matrices with prescribed row and column sum vectors
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
- The asymptotic number of labeled graphs with given degree sequences
- Realizability and uniqueness in graphs
- A reduced formula for the precise number of (0, 1)-matrices in \({\mathcal A}\)(R, S)
- Asymptotic enumeration of dense 0-1 matrices with specified line sums
- An approximation algorithm for counting contingency tables
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- A remark on the existence of finite graphs
- Combinatorial Properties of Matrices of Zeros and Ones
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Sampling contingency tables
- Asymptotic Enumeration of Binary Matrices with Bounded Row and Column Sums
- Enumerating Contingency Tables via Random Permanents
- Difference graphs
- Sampling binary contingency tables with a greedy start
- Inequalities: theory of majorization and its applications
This page was built for publication: Majorization and the number of bipartite graphs for given vertex degrees