The Gale–Ryser theorem is a result in combinatorial mathematics, specifically in the theory of bipartite graphs and matching. It provides a characterization of the matchings in bipartite graphs based on certain conditions related to degree sequences.

Ancestors (6)

  1. Theorems in graph theory
  2. Theorems in discrete mathematics
  3. Discrete mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version