𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a conjecture of Grünbaum concerning partitions of convex sets

✍ Scribed by J. Arocha; J. Jerónimo-Castro; L. Montejano; E. Roldán-Pensado

Publisher
Springer Netherlands
Year
2010
Tongue
English
Weight
149 KB
Volume
60
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A conjecture of Borodin and a coloring o
A conjecture of Borodin and a coloring of Grünbaum
✍ Dieter Rautenbach 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB

## Abstract In 1976, Borodin conjectured that every planar graph has a 5‐coloring such that the union of every __k__ color classes with 1 ≤ __k__ ≤ 4 induces a (__k__—1)‐degenerate graph. We prove the existence of such a coloring using 18 colors. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:139

Proof of a conjecture of Burr, Grünbaum,
Proof of a conjecture of Burr, Grünbaum, and Sloane
✍ Jacob E. Goodman 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 926 KB

We establish a duality principle for arrangements of pseudolines in the projective plane, and thereby prove the conjecture of Burr, Griinbaum, and Sloane that the solution T(p) of the "orchard problem" for pseudoline arrangements and the solution r(p) of the dual problem xe equa1.