✦ LIBER ✦

Bear's theorem with infinite lags

✍ Scribed by John Conlisk

Book ID: 104174440
Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 317 KB
Volume: 3
Category: Article
ISSN: 0165-1889
DOI: 10.1016/0165-1889(81)90003-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

May’s Theorem with an infinite populatio

May’s Theorem with an infinite population

✍ Mark Fey 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 358 KB

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

Menger’s theorem for infinite graphs

✍ Ron Aharoni; Eli Berger 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 654 KB

Whitney's theorem for infinite graphs

✍ A.R. Bednarek 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 111 KB

An infinite-dimensional theorem analogou

An infinite-dimensional theorem analogous to Lie's weight theorem

✍ D. L. Gurarii; Yu. I. Lyubich 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 353 KB

Greene-Kleitman's theorem for infinite p

Greene-Kleitman's theorem for infinite posets

✍ Ron Aharoni; Vladimir Korman 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 514 KB

It IS proved that If (Y, <) IS a poset with no Infinite chain and k IS a positive integer, then there exist a partition of .Jp into disjoint chains C, and disjoint antichains A,, A,. , A,., such that each chain C, meets min (k, IC, I) antichams A,. We make a 'dual' conjecture, for which the case k =