## 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
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
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
## 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