Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,378,465 papers from all fields of science
Search
Sign In
Create Free Account
Bipartite realization problem
The bipartite realization problem is a classical decision problem in graph theory, a branch of combinatorics. Given two finite sequences and of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Contingency table
Decision problem
Degree (graph theory)
Digraph realization problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
The Connection between the Number of Realizations for Degree Sequences and Majorization
A. Berger
arXiv.org
2012
Corpus ID: 279944
The \emph{graph realization problem} is to find for given nonnegative integers $a_1,\dots,a_n$ a simple graph (no loops or…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE