Erdős–Gallai theorem
id:
erd-s-gallai-theorem-247-4833721
title:
Erdős–Gallai theorem
text:
The Erdős–Gallai theorem is a result in graph theory, a branch of combinatorial mathematics. It provides one of two known approaches to solving the graph realization problem, i.e. it gives a necessary and sufficient condition for a finite sequence of natural numbers to be the degree sequence of a simple graph. A sequence obeying these conditions is called "graphic". The theorem was published in 1960 by Paul Erdős and Tibor Gallai, after whom it is named.
brand slug:
wiki
category slug:
encyclopedia
description:
Description of degree sequences of graphs
original url:
https://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93Gallai_theorem
date created:
date modified:
2024-03-03T18:35:20Z
main entity:
{"identifier":"Q5385323","url":"https://www.wikidata.org/entity/Q5385323"}
image:
fields total:
13
integrity:
14