✦ LIBER ✦

PROBLEMS AND RESULTS IN COMBINATORIAL GEOMETRY

✍ Scribed by P. Erdös

Book ID: 118722203
Publisher: John Wiley and Sons
Year: 1985
Tongue: English
Weight: 510 KB
Volume: 440
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1985.tb14533.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some results in combinatorial geometry

✍ H.L. Abbott 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 276 KB

A problem in combinatorial geometry

✍ Yu. A. Brudnyi; B. D. Kotlyar 📂 Article 📅 1971 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 168 KB

Combinatorial Geometry Problems in Patte

Combinatorial Geometry Problems in Pattern Recognition

✍ Braß 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 286 KB

On a combinatorial problem in geometry

✍ H.L. Abbott; D. Hanson 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 382 KB

On a problem in combinatorial geometry

✍ P. Erdös; G. Purdy; E.G. Straus 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 778 KB

On a problem in combinatorial geometry

✍ Vojtěch Rödl 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 253 KB

Let us fix a number a, O< a < 2. We join two p0int.s on the unit sphere Sm in the real m-space iff their distance is a. Denote the obtained graph by g,,,. We prove that the chromatic number x(9@,,,) tends to infinity when m --+ a. This gives a positive answer to a question of P. Erdiis.