✦ LIBER ✦

Proof of Grünbaum's conjecture on the stretchability of certain arrangements of pseudolines

✍ Scribed by Jacob E Goodman; Richard Pollack

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 374 KB
Volume: 29
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(80)90038-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A proof of Szep's conjecture on nonsimpl

A proof of Szep's conjecture on nonsimplicity of certain finite groups

✍ Elsa Fisman; Zvi Arad 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 794 KB

On the number of triangles in simple arr

On the number of triangles in simple arrangements of pseudolines in the real projective plane

✍ Jean-Pierre Roudneff 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 445 KB

Proof of a Conjecture of Bollob?s on Nes

Proof of a Conjecture of Bollob?s on Nested Cycles

✍ Guantao Chen; Paul Erdós; William Staton 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 221 KB

For any positive integer k, a minimum degree condition is obtained which forces a graph to have k edge-disjoint cycles C 1 , C 2 , ..., C k such that V(C 1

Proof of Worlock's conjecture on the Ram

Proof of Worlock's conjecture on the Raman activity of soft modes

✍ J.L. Birman 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 82 KB

Notes on Egoritsjev's proof of the van d

Notes on Egoritsjev's proof of the van der Waerden conjecture

✍ J.H. van Lint 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 446 KB

Proof of Mader's conjecture on k-critica

Proof of Mader's conjecture on k-critical n-connected graphs

✍ Su Jianji 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 1 views

## Abstract Mader conjectured that every __k__‐critical __n__‐connected noncomplete graph __G__ has __2k__ + 2 pairwise disjoint fragments. The author in 9 proved that the conjecture holds if the order of __G__ is greater than (__k__ + 2)__n__. Now we settle this conjecture completely. © 2004 Wiley