✦ LIBER ✦

Minimax theorems for infinite graphs with the ends as ideal points

✍ Scribed by Norbert Polat

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 532 KB
Volume: 130
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)00525-v

No coin nor oath required. For personal study only.

✦ Synopsis

For a set ~2 of pairwise disjoint sets of ends of an infinite graph, we define the concepts of d-paths and of d-separators, and we determine the maximum number of pairwise disjoint d-path.

📜 SIMILAR VOLUMES

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

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

Major amputation compared with graft occ

Major amputation compared with graft occlusion as the end point for assessing results of bypass surgery in lower limb ischaemia

✍ Mr. T. Mikulin; B. R. Hopkinson; G. S. Makin 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 420 KB 👁 3 views