Library

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Geometriae dedicata 56 (1995), S. 115-120 
    ISSN: 1572-9168
    Keywords: 52-XX
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A setL of points in thed-spaceE d is said toilluminate a familyF={S 1, ...,S n } ofn disjoint compact sets inE d if for every setS i inF and every pointx in the boundary ofS i there is a pointv inL such thatv illuminatesx, i.e. the line segment joiningv tox intersects the union of the elements ofF in exactly {x}. The problem we treat is the size of a setS needed to illuminate a familyF={S 1, ...,S n } ofn disjoint compact sets inE d . We also treat the problem of putting these convex sets in mutually disjoint convex polytopes, each one having at most a certain number of facets.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Discrete & computational geometry 7 (1992), S. 189-195 
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Given a setA inR 2 and a collectionS of plane sets, we say that a lineL separatesA fromS ifA is contained in one of the closed half-planes defined byL, while every set inS is contained in the complementary closed half-plane. We prove that, for any collectionF ofn disjoint disks inR 2, there is a lineL that separates a disk inF from a subcollection ofF with at least ⌌(n−7)/4⌍ disks. We produce configurationsH n andG n , withn and 2n disks, respectively, such that no pair of disks inH n can be simultaneously separated from any set with more than one disk ofH n , and no disk inG n can be separated from any subset ofG n with more thann disks. We also present a setJ m with 3m line segments inR 2, such that no segment inJ m can be separated from a subset ofJ m with more thanm+1 elements. This disproves a conjecture by N. Alonet al. Finally we show that ifF is a set ofn disjoint line segments in the plane such that they can be extended to be disjoint semilines, then there is a lineL that separates one of the segments from at least ⌌n/3⌍+1 elements ofF.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Combinatorica 11 (1991), S. 55-61 
    ISSN: 1439-6912
    Keywords: 05 C 05 ; Spanning tree ; maximum degree ; k-connected graph and independence number
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Lets andk be positive integers. We prove that ifG is ak-connected graph containing no independent set withks+2 vertices thenG has a spanning tree with maximum degree at mosts+1. Moreover ifs≥3 and the independence number α(G) is such that α(G)≤1+k(s−1)+c for some0≤c≤k thenG has a spanning tree with no more thanc vertices of degrees+1.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...