---
tag: SVX1CQ4CR2
kind: problem
name: Graph realization problem
aliases: [graph-realizability]
sources:
  - wikipedia: en:43304622@r1298050546
    locator: Graph realization problem
    note: adopted
    mention: wikipedia://en/43304622
    sections: [Problem]
same_as:
  wikidata: Q18207520
  wikipedia: Graph realization problem
inventory: [93P7F0HEZ9]
---

## Problem

The **graph realization problem** is a decision problem in graph theory. Given a finite sequence $(d_1,\dots,d_n)$ of natural numbers, the problem asks whether there is a labeled [[simple graph|00C0BR7D7H]] such that $(d_1,\dots,d_n)$ is the degree sequence of this graph.