Library

X
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
    Random polytopes in thed-dimensional cube (1986)
    Springer
    Discrete & computational geometry 1 (1986), S. 315-319 
    Details
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract LetC d be the set of vertices of ad-dimensional cube,C d ={(x 1, ...,x d ):x i =±1}. Let us choose a randomn-element subsetA(n) ofC d . Here we prove that Prob (the origin belongs to the convA(2d+x→2d))=φ(x)+o(1) ifx is fixed andd → ∞. That is, for an arbitraryε〉0 the convex hull of more than (2+ε)d vertices almost always contains 0 while the convex hull of less than (2-ε)d points almost always avoids it.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02187704
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    On the number of halving planes (1990)
    Springer
    Combinatorica 10 (1990), S. 175-183 
    Details
    ISSN: 1439-6912
    Keywords: 52 A 37
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract LetS ⊂ℝ3 be ann-set in general position. A plane containing three of the points is called a halving plane if it dissectsS into two parts of equal cardinality. It is proved that the number of halving planes is at mostO(n 2.998). As a main tool, for every setY ofn points in the plane a setN of sizeO(n 4) is constructed such that the points ofN are distributed almost evenly in the triangles determined byY.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02123008
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    On the fractional matching polytope of a hypergraph (1993)
    Springer
    Combinatorica 13 (1993), S. 167-180 
    Details
    ISSN: 1439-6912
    Keywords: 05 D 15
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract For a hypergraph ℋ andb:ℋ→ℝ+ define Conjecture. There is a matching ℳ of ℋ such that For uniform ℋ andb constant this is the main theorem of [4]. Here we prove the conjecture if ℋ is uniform or intersecting, orb is constant.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01303202
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Nonexistence of universal graphs without some trees (1997)
    Springer
    Combinatorica 17 (1997), S. 163-171 
    Details
    ISSN: 1439-6912
    Keywords: 05C10 ; 05C60 ; 05C05
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract IfG is a finite tree with a unique vertex of largest, and ≥4 degree which is adjacent to a leaf then there is no universal countableG-free graph.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01200905
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Bounding one-way differences (1987)
    Springer
    Graphs and combinatorics 3 (1987), S. 341-347 
    Details
    ISSN: 1435-5914
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Letf(n, k) denote the maximum length of a sequence (F 1,F 2,...) of distinct subsets of ann-element set with the property that|F i ∖F j | 〈 k for alli 〈 j. We determine the exact values off(n, 2) and characterize all the extremal sequences. Fork ≥ 3 we prove that $$f(n,k) = (1 + o(1))\left( {\begin{array}{*{20}c} n \\ k \\ \end{array} } \right)$$ . Some related problems are also considered.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01788556
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Colouring finite incidence structures (1986)
    Springer
    Graphs and combinatorics 2 (1986), S. 339-346 
    Details
    ISSN: 1435-5914
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract One of our results: Let ℙ denote a finite projective plane of ordern. Colour its vertices byχ colours. If no colour appears more than twice on any of the lines, thenχ ≥ n + 1. Explicit constructions show that this bound is sharp when ℙ is desarguesian.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01788107
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Legitimate colorings of projective planes (1989)
    Springer
    Graphs and combinatorics 5 (1989), S. 95-106 
    Details
    ISSN: 1435-5914
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract For a projective plane ℙ n of ordern, letϰ(ℙ n ) denote the minimum numberk, so that there is a coloring of the points of ℙ n ink colors such that no two distinct lines contain precisely the same number of points of each color. Answering a question of A. Rosa, we show that for all sufficiently largen, 5 ≤ϰ(ℙ n ) ≤ 8 for every projective plane ℙ n of ordern.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01788662
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    t-expansive andt-wise intersecting hypergraphs (1986)
    Springer
    Graphs and combinatorics 2 (1986), S. 67-80 
    Details
    ISSN: 1435-5914
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We give a hypergraph generalization of Gallai's theorem about factor-critical graphs. This result can be used to determineτ *(r, t) forr 〈 3t/2, whereτ *(r, t) denotes the maximum value of the fractional covering numbers oft-wise intersecting hypergraphs of rankr.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01788079
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    The chromatic index of simple hypergraphs (1986)
    Springer
    Graphs and combinatorics 2 (1986), S. 89-92 
    Details
    ISSN: 1435-5914
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01788081
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    On the kernel of intersecting families (1987)
    Springer
    Graphs and combinatorics 3 (1987), S. 91-94 
    Details
    ISSN: 1435-5914
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Letℱ be at-wises-intersecting family, i.e.,|F 1 ∩ ... ∩ F t | ≥ s holds for everyt members ofℱ. Then there exists a setY such that|F 1 ∩ ... ∩ F t ∩ Y| ≥ s still holds for everyF 1,...,F t ∈ℱ. Here exponential lower and upper bounds are proven for the possible sizes ofY.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01788533
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...