The sequences above are able to be the degree sequence for the bipartite graph below it, where each vertex has a degree equal to the number assigned to it.
The bipartite realization problem is a classical decision problem in graph theory , a branch of combinatorics . Given two finite sequences
(
a
1
,
…
,
a
n
)
{\displaystyle (a_{1},\dots ,a_{n})}
and
(
b
1
,
…
,
b
m
)
{\displaystyle (b_{1},\dots ,b_{m})}
of natural numbers with
m
≤
n
{\displaystyle m\leq n}
, the problem asks whether there is a labeled simple bipartite graph such that
(
a
1
,
…
,
a
n
)
,
(
b
1
,
…
,
b
m
)
{\displaystyle (a_{1},\dots ,a_{n}),(b_{1},\dots ,b_{m})}
is the degree sequence of this bipartite graph.