𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On König's Theorem for infinite bipartite graphs

✍ Scribed by Mordechai Lewin

Publisher
Elsevier Science
Year
1972
Tongue
English
Weight
129 KB
Volume
38
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Menger's theorem for infinite graphs wit
Menger's theorem for infinite graphs with ends
✍ Henning Bruhn; Reinhard Diestel; Maya Stein 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

## Abstract A well‐known conjecture of Erdős states that given an infinite graph __G__ and sets __A__, ⊆ __V__(__G__), there exists a family of disjoint __A__ − __B__ paths 𝓅 together with an __A__ − __B__ separator __X__ consisting of a choice of one vertex from each path in 𝓅. There is a natural

A minimax theorem for infinite graphs wi
A minimax theorem for infinite graphs with ideal points
✍ Norbert Polat 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 617 KB

Polat, N., A minimax theorem for infinite graphs with ideal points, Discrete Mathematics 103 (1992) 57-65. Let d be a family of sets of ends of an infinite graph, having the property that every element of any member of 1 can be separated from the union of all other members by a finite set of vertice

On Whitney's 2-isomorphism theorem for g
On Whitney's 2-isomorphism theorem for graphs
✍ K. Truemper 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 355 KB

## Abstract Let __G__ and __H__ be 2‐connected 2‐isomorphic graphs with __n__ nodes. Whitney's 2‐isomorphism theorem states that __G__ may be transformed to a graph __G__\* isomorphic to __H__ by repeated application of a simple operation, which we will term “switching”. We present a proof of Whitn