Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,424,845 papers from all fields of science
Search
Sign In
Create Free Account
Gale–Ryser theorem
Known as:
Gale-Ryser theorem
The Gale–Ryser theorem is a result in graph theory and combinatorial matrix theory, two branches of combinatorics. It provides one of two known…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Adjacency matrix
Bipartite realization problem
Degree (graph theory)
Directed graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The matching number of tree and bipartite degree sequences
F. Bock
,
D. Rautenbach
2018
Corpus ID: 55224177
We study the possible values of the matching number among all trees with a given degree sequence as well as all bipartite graphs…
Expand
2014
2014
On linear equations arising in Combinatorics (Part II)
M. Aryapoor
2014
Corpus ID: 119131520
The main point of this paper is to present a class of equations over integers that one can check if they have a solution by…
Expand
2011
2011
AN OPTIMAL COLORING FROM A BODY OF REVOLUTION
Mitsuo Kato
,
G. Katona
2011
Corpus ID: 14425186
Consider the number of monochromatic k-cliques in an edge-two-coloring of the complete graph of order n. We determine…
Expand