Accession Number:

AD0668421

Title:

SUBGRAPHS OF BIPARTITE AND DIRECTED GRAPHS

Descriptive Note:

Corporate Author:

RAND CORP SANTA MONICA CA

Personal Author(s):

Report Date:

1968-04-01

Pagination or Media Count:

27.0

Abstract:

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.

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE