SUBGRAPHS OF BIPARTITE AND DIRECTED GRAPHS
RAND CORP SANTA MONICA CA
Pagination or Media Count:
The main theorem of this study provides necessary and sufficient conditions for a locally finite bipartite graph to have a subgraph whose valences lie in prescribed intervals. The theorem is applied to the study of integer-valued flows in locally finite directed graphs. In particular, generalizations of the max-flow min-cut theorem and the circulation theorem are obtained. The axiom of choice is assumed throughout.
- Theoretical Mathematics