Skip to main content

Hamiltonian decompositions of graph products

Data news
foto persona

Giovedì 4 giugno con inizio alle ore 15.00 presso l'aula Seminari in via valotti 9, Speaker Alice Lacaze-Masmonteil
Department of Mathematics and Statistics, University of Regina, SK, Canada, terrà un Seminario dal titolo:

Hamiltonian decompositions of graph products

Abstract.
A graph is said to be Hamiltonian decomposable if it admits a decomposition into Hamiltonian cycles. The question of existence of a Hamiltonian decomposition has been considered for numerous classes of graphs including complete graphs, certain Cayley graphs, and the Paley graph to name a few. One particular set of graphs of interest are graphs that arise as a product of two graphs. A natural question is to ask if the product of two Hamiltonian decomposable graphs is also Hamiltonian decomposable. In this talk, I will show that the answer to this question is often affirmative by surveying results on Hamiltonian decomposition of various products of Hamiltonian decomposable graphs. I will also demonstrate how Hamiltonian decompositions of graph products can be applied to attack fundamental problems in cycle decomposition. Lastly, I will discuss some recent results on directed Hamiltonian decomposi.

Il seminario  si terrà in modalità mista
Online: https://meet.google.com/kom-nvfw-ptq