✦ LIBER ✦

On Unions and Intersections of Simply Connected Planar Sets

✍ Scribed by U. H. Karimov; D. Repovš; M. Željko

Publisher: Springer Vienna
Year: 2005
Tongue: English
Weight: 94 KB
Volume: 145
Category: Article
ISSN: 0026-9255
DOI: 10.1007/s00605-004-0294-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Simply connected orthogonal polygons as

Simply connected orthogonal polygons as unions of two orthogonally starshaped sets

✍ Marilyn Breen 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 118 KB

On families of finite sets with bounds o

On families of finite sets with bounds on unions and intersections

✍ Chang Bang; Henry Sharp Jr.; Peter Winkler 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 364 KB

We present a conjecture, with some supporting results, concerning the maximum size of a family of subsets satisfying the following conditions: the intersection of any two members of the family has cardinal@ at least s, and the intersection of the complements of any two members has cardinal@ at least

On systems of finite sets with constrain

On systems of finite sets with constraints on their unions and intersections

✍ Da-Lun Wang 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 236 KB

An inequality for the weights of two fam

An inequality for the weights of two families of sets, their unions and intersections

✍ Rudolf Ahlswede; David E. Daykin 📂 Article 📅 1978 🏛 Springer 🌐 English ⚖ 114 KB

On the Boundary of the Union of Planar C

On the Boundary of the Union of Planar Convex Sets

✍ J. Pach; M. Sharir 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 119 KB

On the Hardness of Computing Intersectio

On the Hardness of Computing Intersection, Union and

✍ Hans Raj Tiwary 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 317 KB