The Goldberg-Seymour Conjecture
Professor Guantao Chen
Department of Mathematics and Statistics
Georgia State University
Given a multigraph , the edge-coloring problem (ECP) is to color the edges of G with the minimum number of colors so that no two adjacent edges have the same color. This problem can be naturally formulated as an integer program, and its linear programming relaxation is called the fractional edge-coloring problem (FECP). In the literature, the optimal value of ECP (resp. FECP) is called the chromatic index (resp. fractional chromatic index) of , denoted by G) (resp. ). Let be the maximum degree of and let . Clearly, is a lower bound for . As shown by Seymour, . In the 1970s Goldberg and Seymour independently conjectured that χ. Over the past four decades this conjecture, a cornerstone in modern edge-coloring, has been a subject of extensive research, and has stimulated a significant body of work. I will report the proof of this conjecture and problems surrounding this conjecture.
Refreshments will be served from 2:00-3:00pm in MSB 201.
Location:Mathematical Sciences Building: 318