1,225 research outputs found

    The existence of thick triangulations -- an "elementary" proof

    Get PDF
    We provide an alternative, simpler proof of the existence of thick triangulations for noncompact C1\mathcal{C}^1 manifolds. Moreover, this proof is simpler than the original one given in \cite{pe}, since it mainly uses tools of elementary differential topology. The role played by curvatures in this construction is also emphasized.Comment: 7 pages Short not

    On a Set of Lattice Points not Containing the Vertices of a Square

    Get PDF

    Further results on snakes in powers of complete graphs

    Get PDF
    AbstractBy a snake in a finite graph G is meant a cycle without chords. Denoted by S(G) the length of a longest snake in G. In this paper we obtain a new lower bound for S(G) in the case where G is the product of d copies of the complete graph on n vertices

    On the snake in the box problem

    Get PDF
    AbstractA snake in a graph is a simple cycle without chords. Denote by s(d) the length of a longest snake in the d-dimensional unit cube. We give a new proof of the theorem of Evdokimov that s(d) > λ2d, where λ is a positive constant

    Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces

    Get PDF
    It is well known that any set of n intervals in R1\mathbb{R}^1 admits a non-monochromatic coloring with two colors and a conflict-free coloring with three colors. We investigate generalizations of this result to colorings of objects in more complex 1-dimensional spaces, namely so-called tree spaces and planar network spaces
    • …
    corecore