BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Guantao Chen (Georgia State University) DTSTART:20201203T020000Z DTEND:20201203T030000Z DTSTAMP:20260423T021016Z UID:SCMSComb/25 DESCRIPTION:Title: Graph Edge Coloring\nby Guantao Chen (Georgia State University) as p art of SCMS Combinatorics Seminar\n\n\nAbstract\nGraph edge coloring is a well established subject in the field of graph theory\, it is one of the b asic combinatorial optimization problems: color the edges of a graph G wit h as few colors as possible such that each edge receives a color and adjac ent edges\, that is\, different edges incident to a common vertex\, receiv e different colors. The minimum number of colors needed for such a colorin g of G is called the chromatic index of G\, written $\\chi(G)$. By a resul t of Holyer\, the determination of the chromatic index is an NP-hard optim ization problem. The NP-hardness gives rise to the necessity of using heur istic algorithms. In particular\, we are interested in upper bounds for th e chromatic index that can be efficiently realized by a coloring algorithm . In this talk\, we will start with the well-known Goldberg-Seymour conjec ture and its proof\, then talk about the recent development of recoloring techniques and its applications to a number of classic problems in critica l class 2 simple graphs.\n\npw 030303\n LOCATION:https://researchseminars.org/talk/SCMSComb/25/ END:VEVENT END:VCALENDAR