Embedding large subgraphs into dense graphs

Details Embedding large subgraphs into dense graphs Embedding large subgraphs into dense graphs

2009-01-22

arxiv.org/abs/0901.3541v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Embedding large subgraphs into dense graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Embedding large subgraphs into dense graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Embedding large subgraphs into dense graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-190125