96,396 research outputs found

    The rigidity of infinite graphs

    Full text link
    A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 1<p<\infty. Generalisations are obtained for the Laman and Henneberg combinatorial characterisations of generic infinitesimal rigidity for finite graphs in the Euclidean plane. Also Tay's multi-graph characterisation of the rigidity of generic finite body-bar frameworks in d-dimensional Euclidean space is generalised to the non-Euclidean l^p norms and to countably infinite graphs. For all dimensions and norms it is shown that a generically rigid countable simple graph is the direct limit of an inclusion tower of finite graphs for which the inclusions satisfy a relative rigidity property. For d>2 a countable graph which is rigid for generic placements in R^d may fail the stronger property of sequential rigidity, while for d=2 the equivalence with sequential rigidity is obtained from the generalised Laman characterisations. Applications are given to the flexibility of non-Euclidean convex polyhedra and to the infinitesimal and continuous rigidity of compact infinitely-faceted simplicial polytopes.Comment: 51 page

    Linear Choosability of Sparse Graphs

    Get PDF
    We study the linear list chromatic number, denoted \lcl(G), of sparse graphs. The maximum average degree of a graph GG, denoted \mad(G), is the maximum of the average degrees of all subgraphs of GG. It is clear that any graph GG with maximum degree Δ(G)\Delta(G) satisfies \lcl(G)\ge \ceil{\Delta(G)/2}+1. In this paper, we prove the following results: (1) if \mad(G)<12/5 and Δ(G)≥3\Delta(G)\ge 3, then \lcl(G)=\ceil{\Delta(G)/2}+1, and we give an infinite family of examples to show that this result is best possible; (2) if \mad(G)<3 and Δ(G)≥9\Delta(G)\ge 9, then \lcl(G)\le\ceil{\Delta(G)/2}+2, and we give an infinite family of examples to show that the bound on \mad(G) cannot be increased in general; (3) if GG is planar and has girth at least 5, then \lcl(G)\le\ceil{\Delta(G)/2}+4.Comment: 12 pages, 2 figure
    • …
    corecore