Amalgamations of Graphs 

 

Abstract

Over the past 20 years there has been much interest in using graph homomorphisms, known as amalgamations, to study graph decompositions.  In particular, amalgamations have been particularly successful in finding edge-disjoint hamilton cycles in graphs. A survey of such results, and the method itself, will be discussed in this talk that is designed for a general audience.