✦ LIBER ✦

Helly-Type Theorems for Approximate Covering

✍ Scribed by Julien Demouth; Olivier Devillers; Marc Glisse; Xavier Goaoc

Publisher: Springer
Year: 2009
Tongue: English
Weight: 526 KB
Volume: 42
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-009-9167-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Helly-type theorems for spheres

✍ Hiroshi Maehara 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 359 KB

Helly-type theorems about sets

✍ Steve Fisk; Daniel Abbw-Jackson; Dan Kleitman 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 724 KB

Suppose that G ifn a graph. A l-factor is a set of edges of G such that every vertex of G meets exactly one of its edges. Suppose that we have a set Y of l-factors of G such that any two l-factors vf Y have an edge in common. We investigate the following questions: (1) How large may Y be? (2) When

Tolerance in Helly-Type Theorems

✍ L. Montejano; D. Oliveros 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 336 KB

A helly type theorem for hypersurfaces

✍ M Deza; P Frankl 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 177 KB

A Helly-type theorem for simple polygons

✍ Marilyn Breen 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 321 KB

Let P be a family of simple polygons in the plane. If every three (not necessarily distinct) members of P have a simply connected union and every two members of P have a nonempty intersection, then N{P:P in P) ¢ ¢. Applying the result to a finite family C of orthogonally convex polygons, the set fq{

Discrete and Lexicographic Helly-Type Th

Discrete and Lexicographic Helly-Type Theorems

✍ Nir Halman 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 568 KB