Graph realization problem

The problem can be solved in polynomial time. One method of showing this uses the Havel–Hakimi algorithm constructing a special solution with the use of a recursive algorithm.[1][2] Alternatively, following the characterization given by the Erdős–Gallai theorem, the problem can be solved by testing the validity of ${\displaystyle n}$ inequalities.[3]

The problem can also be stated in terms of symmetric matrices of zeros and ones. The connection can be seen if one realizes that each graph has an adjacency matrix where the column sums and row sums correspond to ${\displaystyle (d_{1},\ldots ,d_{n})}$. The problem is then sometimes denoted by symmetric 0-1-matrices for given row sums.

Similar problems describe the degree sequences of simple bipartite graphs or the degree sequences of simple directed graphs. The first problem is the so-called bipartite realization problem. The second is known as the digraph realization problem.

The problem of constructing a solution for the graph realization problem with the additional constraint that each such solution comes with the same probability was shown to have a polynomial-time approximation scheme for the degree sequences of regular graphs by Cooper, Martin, and Greenhill.[4] The general problem is still unsolved.