7,120 research outputs found

    Embedding large subgraphs into dense graphs

    Full text link
    What conditions ensure that a graph G contains some given spanning subgraph H? The most famous examples of results of this kind are probably Dirac's theorem on Hamilton cycles and Tutte's theorem on perfect matchings. Perfect matchings are generalized by perfect F-packings, where instead of covering all the vertices of G by disjoint edges, we want to cover G by disjoint copies of a (small) graph F. It is unlikely that there is a characterization of all graphs G which contain a perfect F-packing, so as in the case of Dirac's theorem it makes sense to study conditions on the minimum degree of G which guarantee a perfect F-packing. The Regularity lemma of Szemeredi and the Blow-up lemma of Komlos, Sarkozy and Szemeredi have proved to be powerful tools in attacking such problems and quite recently, several long-standing problems and conjectures in the area have been solved using these. In this survey, we give an outline of recent progress (with our main emphasis on F-packings, Hamiltonicity problems and tree embeddings) and describe some of the methods involved

    Generating random graphs in biased Maker-Breaker games

    Full text link
    We present a general approach connecting biased Maker-Breaker games and problems about local resilience in random graphs. We utilize this approach to prove new results and also to derive some known results about biased Maker-Breaker games. In particular, we show that for b=o(n)b=o\left(\sqrt{n}\right), Maker can build a pancyclic graph (that is, a graph that contains cycles of every possible length) while playing a (1:b)(1:b) game on E(Kn)E(K_n). As another application, we show that for b=Θ(n/lnn)b=\Theta\left(n/\ln n\right), playing a (1:b)(1:b) game on E(Kn)E(K_n), Maker can build a graph which contains copies of all spanning trees having maximum degree Δ=O(1)\Delta=O(1) with a bare path of linear length (a bare path in a tree TT is a path with all interior vertices of degree exactly two in TT)

    Hamilton cycles in highly connected and expanding graphs

    Full text link
    In this paper we prove a sufficient condition for the existence of a Hamilton cycle, which is applicable to a wide variety of graphs, including relatively sparse graphs. In contrast to previous criteria, ours is based on only two properties: one requiring expansion of ``small'' sets, the other ensuring the existence of an edge between any two disjoint ``large'' sets. We also discuss applications in positional games, random graphs and extremal graph theory.Comment: 19 page
    corecore