𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Coloring infinite graphs and the Boolean prime ideal theorem

✍ Scribed by H. Läuchli

Book ID
112888811
Publisher
The Hebrew University Magnes Press
Year
1971
Tongue
English
Weight
326 KB
Volume
9
Category
Article
ISSN
0021-2172

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Boolean Prime Ideal Theorem Plus Cou
The Boolean Prime Ideal Theorem Plus Countable Choice Do Not Imply Dependent Choice
✍ Paul Howard; Jean E. Rubin 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 541 KB

Two Fraenkel-Mostowski models are constructed in which the Boolean Prime Ideal Theorem is true. In both models, AC for countable sets is true, but AC for sets of cardinality 2 ' 0 and the 2m = m principle are both false. The Principle of Dependent Choices is true in the first model, but false in the

Minimax theorems for infinite graphs wit
Minimax theorems for infinite graphs with the ends as ideal points
✍ Norbert Polat 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 532 KB

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.