"Amalgamations and Hamilton Decompositions" by Chris Rodger
 

Document Type

Lecture

Publication Date

4-16-2013

Abstract

In this talk, we will explore the use of amalgamations in the construction of graph decompositions, most often looking for hamilton cycle decompositions. This method uses graph homomorphisms to envision an outline of the structure of interest, then attempts to disentangle the merging of vertices e ected by the homomorphism in such an outline structure. As will be shown, this method has proved to be very e ective, for example, in the studying the embedding of edge-colorings of graphs into hamilton decompositions, and the existence of maximal sets of hamilton cycles in various graphs. The talk is full of pictures with few technical details, so is suitable for a wide audience.

Relational Format

presentation

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.