Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Gale–Ryser_theorem> ?p ?o. }
Showing items 1 to 10 of
10
with 100 items per page.
- Gale–Ryser_theorem abstract "The Gale–Ryser theorem is a result in graph theory and combinatorial matrix theory, two branches of combinatorics, that gives a necessary and sufficient condition for two finite sequences of natural numbers to be the degree sequence of a bipartite graph. It is an analog of the Erdős–Gallai theorem for bipartite graphs. The theorem was published in 1963 by H. J. Ryser.".
- Gale–Ryser_theorem wikiPageID "42442683".
- Gale–Ryser_theorem wikiPageRevisionID "603560145".
- Gale–Ryser_theorem subject Category:Theorems_in_graph_theory.
- Gale–Ryser_theorem comment "The Gale–Ryser theorem is a result in graph theory and combinatorial matrix theory, two branches of combinatorics, that gives a necessary and sufficient condition for two finite sequences of natural numbers to be the degree sequence of a bipartite graph. It is an analog of the Erdős–Gallai theorem for bipartite graphs. The theorem was published in 1963 by H. J. Ryser.".
- Gale–Ryser_theorem label "Gale–Ryser theorem".
- Gale–Ryser_theorem sameAs Gale%E2%80%93Ryser_theorem.
- Gale–Ryser_theorem sameAs Q17015268.
- Gale–Ryser_theorem sameAs Q17015268.
- Gale–Ryser_theorem wasDerivedFrom Gale–Ryser_theorem?oldid=603560145.