Gale–Ryser theorem
id:
gale-ryser-theorem-294-14664412
title:
Gale–Ryser theorem
text:
The Gale–Ryser theorem is a result in graph theory and combinatorial matrix theory, two branches of combinatorics. It provides one of two known approaches to solving the bipartite realization problem, i.e. it gives a necessary and sufficient condition for two finite sequences of natural numbers to be the degree sequence of a labeled simple bipartite graph; a sequence obeying these conditions is called "bigraphic". It is an analog of the Erdős–Gallai theorem for simple graphs. The theorem was pub
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Gale%E2%80%93Ryser_theorem
date created:
date modified:
2024-03-01T18:59:03Z
main entity:
{"identifier":"Q17015268","url":"https://www.wikidata.org/entity/Q17015268"}
image:
fields total:
13
integrity:
13