Back to Search
Start Over
A constructive proof of the Fulkerson–Ryser characterization of digraphic sequences.
- Source :
-
Discrete Mathematics, Algorithms & Applications . Jul2024, Vol. 16 Issue 5, p1-8. 8p. - Publication Year :
- 2024
-
Abstract
- Analogous to the Erdos–Gallai inequalities that give necessary and sufficient conditions for the existence of a graph on n vertices with prescribed vertex degrees, the Ryser–Fulkerson inequalities give necessary and sufficient conditions for the existence of a digraph on n vertices with prescribed indegrees and outdegrees of the vertices. In this note, we give a short constructive proof of the sufficiency of the Ryser–Fulkerson inequalities. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 17938309
- Volume :
- 16
- Issue :
- 5
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics, Algorithms & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 177091155
- Full Text :
- https://doi.org/10.1142/S1793830923500568