---
tag: 13P7YE8CC8
kind: problem
name: Bipartite realization problem
sources:
  - wikipedia: en:43264877@r1336679097
    locator: Bipartite realization problem
    note: adopted
    mention: wikipedia://en/43264877
    sections: [Problem]
same_as:
  wikidata: Q18206555
  wikipedia: Bipartite realization problem
inventory: [4T83KJK73Y]
---

## Problem

The **bipartite realization problem** is a classical decision problem in graph theory, a branch of [[combinatorics|0JKW7W7XFR]]. Given two finite sequences $(a_1,\dots,a_n)$ and $(b_1,\dots,b_m)$ of [[natural numbers|0MWKJ44V5A]] with $m\leq n$, the problem asks whether there is a labeled simple [[bipartite graph|07DVHJ8N0A]] such that $(a_1,\dots,a_n), (b_1,\dots,b_m)$ is the [[degree sequence|07DVHJ8N0A]] of this bipartite graph.