ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • 05 C 35  (1)
  • Lines in space  (1)
  • Ramsey's theorem  (1)
Collection
Keywords
Publisher
Years
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Geometriae dedicata 81 (2000), S. 1-12 
    ISSN: 1572-9168
    Keywords: Ramsey's theorem ; Erdős-Szekeres theorem ; convexity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A family $$\mathcal{F}$$ of convex sets is said to be in convex position, if none of its members is contained in the convex hull of the others. It is proved that there is a function N(n) with the following property. If $$\mathcal{F}$$ is a family of at least N(n) plane convex sets with nonempty interiors, such that any two members of $$\mathcal{F}$$ have at most two boundary points in common and any three are in convex position, then $$\mathcal{F}$$ has n members in convex position. This result generalizes a theorem of T. Bisztriczky and G. Fejes Tóth. The statement does not remain true, if two members of $$\mathcal{F}$$ may share four boundary points. This follows from the fact that there exist infinitely many straight-line segments such that any three are in convex position, but no four are. However, there is a function M(n) such that every family of at least M(n) segments, any four of which are in convex position, has n members in convex position.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 9 (1993), S. 561-571 
    ISSN: 1432-0541
    Keywords: Line weavings ; Lines in space
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Aweaving W is a simple arrangement of lines (or line segments) in the plane together with a binary relation specifying which line is “above” the other. A system of lines (or line segments) in 3-space is called arealization ofW, if its projection into the plane isW and the “above-below” relations between the lines respect the specifications. Two weavings are equivalent if the underlying arrangements of lines are combinatorially equivalent and the “above-below” relations are the same. An equivalence class of weavings is said to be aweaving pattern. A weaving pattern isrealizable if at least one element of the equivalence class has a three-dimensional realization. A weaving (pattern)W is calledperfect if, along each line (line segment) ofW, the lines intersecting it are alternately “above” and “below.” We prove that (i) a perfect weaving pattern ofn lines is realizable if and only ifn ≤ 3, (ii) a perfect m byn weaving pattern of line segments (in a grid-like fashion) is realizable if and only if min(m, n) ≤ 3, (iii) ifn is sufficiently large, then almost all weaving patterns ofn lines are nonrealizable.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Combinatorica 17 (1997), S. 1-9 
    ISSN: 1439-6912
    Keywords: 05 C 35 ; 05 C 40 ; 68 R 05
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A graph is calledquasi-planar if it can be drawn in the plane so that no three of its edges are pairwise crossing. It is shown that the maximum number of edges of a quasi-planar graph withn vertices isO(n).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...