Embedding spanning subgraphs into large dense graphs

Abstract

In this thesis we are going to present some results on embedding spanning subgraphs into large dense graphs. Spanning Trees. Bollobas conjectured that if G is a graph on n vertices, δ(G) ≥ (1/2 + e)n for some e > 0, and T is a bounded degree tree on n vertices, then T is a subgraph of G. The problem was solved in the affirmative by Komlos, Sarkozy and Szemeredi for large graphs. They then strengthened their result, and showed that the maximum degree of T need not be bounded: there exists a constant c such that T is a subgraph of G if Δ( T) ≤ cn/ log n, δ( G) ≥ (1/2 + e)n and n is large. Both proofs are based on the Regularity Lemma-Blow-up Lemma Method. Recently, using other methods, it was shown that bounded degree trees embed into graphs with minimum degree n/2+C log n, where C is a constant depending on the maximum degree of T. Here we show that in general n/2 + O(Δ(T) · log n) is sufficient for every Δ(T) ≤ cn/ log n. We also show that this bound is tight for the two extreme values of m i.e. when m = C and when m = cn/ log n. Powers of Hamiltonian Cycles. In 1962 Posa conjectured that if δ(G) ≥ fn then G contains the square of a Hamiltonian cycle. Later, in 1974, Seymour generalized this conjecture: if δ(G) ≥ ( k-1k )n then G contains the ( k – 1)th power of a Hamiltonian cycle. In 1998 the conjecture was proved by Komlos, Sarkozy and Szemeredi for large graphs using the Regularity Lemma. We present a “deregularised” proof of the Posa-Seymour conjecture which results in a much lower threshold value for n, the size of the graph for which the conjecture is true. We hope that the tools used in this proof will push down the threshold value for n to around 100 at which point we will be able to verify the conjecture for every n.