Bipartite realization problem

The bipartite realization problem is a classical decision problem in graph theory, a branch of combinatorics. Given two finite sequences $(a_{1},\dots ,a_{n})$ and $(b_{1},\dots ,b_{n})$ of natural numbers, the problem asks whether there is labeled simple bipartite graph such that $(a_{1},\dots ,a_{n}),(b_{1},\dots ,b_{n})$ is the degree sequence of this bipartite graph.

Solutions

The problem belongs to the complexity class P. This can be proven using the Gale–Ryser theorem, i.e., one has to validate the correctness of $n$ inequalities.

Other notations

The problem can also be stated in terms of zero-one matrices. The connection can be seen if one realizes that each bipartite graph has a biadjacency matrix where the column sums and row sums correspond to $(a_{1},\ldots ,a_{n})$ and $(b_{1},\ldots ,b_{n})$ . The problem is then often denoted by 0-1-matrices for given row and column sums. In the classical literature the problem was sometimes stated in the context of contingency tables by contingency tables with given marginals. A third formulation is in terms of degree sequences of simple directed graphs with at most one loop per vertex. In this case the matrix is interpreted as the adjacency matrix of such a directed graph. When are pairs of non-negative integers ((a₁,b₁), ..., (a_n,b_n)) the indegree-outdegree pairs of a labeled directed graph with at most one loop per vertex?

Related problems

Similar problems describe the degree sequences of simple graphs and simple directed graphs. The first problem is the so-called graph realization problem. The second is known as the digraph realization problem. The bipartite realization problem is equivalent to the question, if there exists a labeled bipartite subgraph of a complete bipartite graph to a given degree sequence. The hitchcock problem asks for such a subgraph minimizing the sum of the costs on each edge which are given for the complete bipartite graph. A further generalization is the f-factor problem for bipartite graphs, i.e. for a given bipartite graph one searches for a subgraph possessing a certain degree sequence. The problem uniform sampling a bipartite graph to a fixed degree sequence is to construct a solution for the bipartite realization problem with the additional constraint that each such solution comes with the same probability. This problem was shown to be in FPTAS for regular sequences by Catherine Greenhill [1] (for regular bipartite graphs with a forbidden 1-factor) and for half-regular sequences by Erdős et al.[2] The general problem is still unsolved.

gollark: Is it permitted to interfere with other entrants?

gollark: <@!293066066605768714> Is the program permitted to do arbitrary things to the machine on which it runs as long as they probably aren't bad much?

gollark: Ah yes, it does say they don't, how bee.

gollark: Although does it say they DON'T?

gollark: Oh, that's a neat idea.

References

Gale, D. (1957). "A theorem on flows in networks". Pacific J. Math. 7 (2): 1073–1082. doi:10.2140/pjm.1957.7.1073.
Ryser, H. J. (1963). Combinatorial Mathematics. John Wiley & Sons.
Greenhill, Catherine (2011). "A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs". Electronic Journal of Combinatorics. 18 (1): 234. arXiv:1105.0457. Bibcode:2011arXiv1105.0457G.
Erdős, P.L.; Kiss, S.Z.; Miklós, I.; Soukup, Lajos (2015). "Approximate Counting of Graphical Realizations". PLOS ONE. 10 (7): e0131300. arXiv:1301.7523. Bibcode:2015PLoSO..1031300E. doi:10.1371/journal.pone.0131300.

Greenhill (1997)
Erdős (2013)

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[1] Greenhill (1997)

[2] Erdős (2013)