Graduate Student Seminar

Speaker: Amin Bahmanian

Title: What are graph amalgamations?"

Abstract: A (hyper)graph G is a pair (V,E) where V is a finite set called the vertex set, E is the edge multiset, where every edge is itself a multi-subset of V. This means that not only can an edge occur multiple times in E, but also each vertex can have multiple occurrences within an edge. Intuitively speaking, a u-detachment of G is a (hyper)graph obtained by splitting a vertex u into one or
more vertices and sharing the incident edges among the subvertices.

In this talk, I discuss various detachment results along with some applications in (hyper)graph decomposition and use this method to find the t-chromatic index of various families of (hyper)graphs.

Note: Amin is a Ph.D. student in our department and will be graduating in the summer; he is working with Dr. Rodger.