DMS Combinatorics Seminar

NOTE TIME for BEGINNING is 2:30

Speaker: Guangming Jing, (University of Massachusetts, Lowell)

Title: Edge Coloring of Multigraphs

Abstract: Given a multigraph \(G=(V,E)\), the chromatic index \(\chi'(G)\) is the minimum number of colors needed to color the edges of \(G\) such that no two adjacent edges receive the same color. Let \(\Delta(G)\) be the maximum degree of \(G\) and let

          \(\Gamma(G) = \max \left\{ \frac{2|E(U)|}{|U|-1} : U \subseteq V,\ |U|\geq 3\ \text{and odd} \right\}.\)

Then  \(\Gamma(G)\) is called the density of \(G\). Clearly, the density is a lower bound for the chromatic index \(\chi'(G)\).

In this talk,  we will discuss several density-related edge coloring problems on multigraphs.