𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Analytic proofs of a network feasibility theorem and a theorem of Fulkerson

✍ Scribed by David J. Houck; Arthur O. Pittenger


Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
335 KB
Volume
24
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A GAME-THEORETIC PROOF OF ANALYTIC RAMSE
✍ Kazuyuki Tanaka πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 217 KB

## Abstract We give a simple game‐theoretic proof of Silver's theorem that every analytic set is Ramsey. A set __P__ of subsets of Ο‰ is called Ramsey if there exists an infinite set __H__ such that either all infinite subsets of __H__ are in __P__ or all out of __P.__ Our proof clarifies a strong c

Duality Theorems for a Continuous Analog
✍ J.D. Chavez; L.H. Harper πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 594 KB

T. C. Hu and K. Jacobs independently proposed continuous analogs of Ford-Fulkerson flows in networks. Their models are different, but both showed that there are difficulties in obtaining maxflow \(=\) mincut theorems. In this paper, using a definition of continuous networks which has already been sh

More proofs of menger's theorem
✍ C. St. J. A. Nash-Williams; W. T. Tutte πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 231 KB

## Abstract Four ways of proving Menger's Theorem by induction are described. Two of them involve showing that the theorem holds for a finite undirected graph __G__ if it holds for the graphs obtained from __G__ by deleting and contracting the same edge. The other two prove the directed version of

A Proof of a Theorem of Tennenbaum
✍ Paul E. Howard πŸ“‚ Article πŸ“… 1972 πŸ› John Wiley and Sons 🌐 English βš– 123 KB πŸ‘ 1 views
A Proof of the Compactness Theorem
✍ Kenneth J. Danhof πŸ“‚ Article πŸ“… 1974 πŸ› John Wiley and Sons 🌐 English βš– 261 KB πŸ‘ 1 views