938 research outputs found

    Minimal reducible bounds for the class of k-degenerate graphs

    Get PDF
    AbstractLet (La,⊆) be the lattice of hereditary and additive properties of graphs. A reducible property R∈La is called minimal reducible bound for a property P∈La if in the interval (P,R) of the lattice La, there are only irreducible properties. We prove that the set B(Dk)={Dp∘Dq:k=p+q+1} is the covering set of minimal reducible bounds for the class Dk of all k-degenerate graphs

    Shortest path embeddings of graphs on surfaces

    Get PDF
    The classical theorem of F\'{a}ry states that every planar graph can be represented by an embedding in which every edge is represented by a straight line segment. We consider generalizations of F\'{a}ry's theorem to surfaces equipped with Riemannian metrics. In this setting, we require that every edge is drawn as a shortest path between its two endpoints and we call an embedding with this property a shortest path embedding. The main question addressed in this paper is whether given a closed surface S, there exists a Riemannian metric for which every topologically embeddable graph admits a shortest path embedding. This question is also motivated by various problems regarding crossing numbers on surfaces. We observe that the round metrics on the sphere and the projective plane have this property. We provide flat metrics on the torus and the Klein bottle which also have this property. Then we show that for the unit square flat metric on the Klein bottle there exists a graph without shortest path embeddings. We show, moreover, that for large g, there exist graphs G embeddable into the orientable surface of genus g, such that with large probability a random hyperbolic metric does not admit a shortest path embedding of G, where the probability measure is proportional to the Weil-Petersson volume on moduli space. Finally, we construct a hyperbolic metric on every orientable surface S of genus g, such that every graph embeddable into S can be embedded so that every edge is a concatenation of at most O(g) shortest paths.Comment: 22 pages, 11 figures: Version 3 is updated after comments of reviewer

    Knots with small rational genus

    Get PDF
    If K is a rationally null-homologous knot in a 3-manifold M, the rational genus of K is the infimum of -\chi(S)/2p over all embedded orientable surfaces S in the complement of K whose boundary wraps p times around K for some p (hereafter: S is a p-Seifert surface for K). Knots with very small rational genus can be constructed by "generic" Dehn filling, and are therefore extremely plentiful. In this paper we show that knots with rational genus less than 1/402 are all geometric -- i.e. they may be isotoped into a special form with respect to the geometric decomposition of M -- and give a complete classification. Our arguments are a mixture of hyperbolic geometry, combinatorics, and a careful study of the interaction of small p-Seifert surfaces with essential subsurfaces in M of non-negative Euler characteristic.Comment: 38 pages, 3 figures; version 3 corrects minor typos; keywords: knots, rational genu
    • …
    corecore