BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
X-WR-CALNAME:Colloquium: Overfull Conjecture and Multigraph Overfull Conjec
 ture
X-WR-TIMEZONE:Eastern Time (US & Canada)
BEGIN:VEVENT
DTSTAMP:20260906T204009Z
UID:tag:localist.com\,2008:EventInstance_47976631968384
DTSTART:20241108T190000Z
DTEND:20241108T200000Z
DESCRIPTION:Date and Time: 11/08/2024\, 2 - 3 p.m.\n\nLocation: 25 Park Pla
 ce\, Room 1441\n\nColloquium: Overfull Conjecture and Multigraph Overfull 
 Conjecture\n\nSpeaker: Dr. Songling Shan\, Department of Mathematics and S
 tatistics\, Auburn University\n\nSpeaker's website: https://www.auburn.edu
 /cosam/faculty/math_stats/shan/index.htm\n\nTitle: Overfull Conjecture and
  Multigraph Overfull Conjecture\n\nAbstract: Let $G$ be a (multi)graph wit
 h maximum degree denoted as $\\Delta(G)$. An overfull subgraph $H$ of $G$ 
 is a subgraph satisfying the condition $|E(H)| > \\Delta(G)\\left\\lfloor\
 \frac{1}{2}|V(H)|\\right\\rfloor$. In 1986\, Chetwynd and Hilton proposed 
 the Overfull Conjecture\, stating that a simple graph $G$ with maximum deg
 ree $\\Delta(G) > \\frac{1}{3}|V(G)|$ has the chromatic index equal to $\\
 Delta(G)$ if and only if it does not contain any overfull subgraphs. The m
 ultigraph version of the Overfull Conjecture was first formed by Stiebitz 
 et al. in 2012\, and it states the following:\n\\begin{quote}\nLet $G$ be 
 a multigraph such that $\\Delta(G) > \\frac{1}{3}r|V(G)|$\, where $r$ is t
 he maximum number of edges joining two vertices in $G$. Then the chromatic
  index of $G$ is equal to $\\Delta(G)$ if and only if $G$ contains no $\\D
 elta(G)$-overfull subgraph.\n\\end{quote}\nIn this talk\, we will discuss 
 some recent progress on both conjectures.\n\nSpeaker's biography: Songling
  Shan\, a 2015 graduate of Georgia State University\, is currently an Assi
 stant Professor in the Department of Mathematics and Statistics at Auburn 
 University. Prior to her current role\, she held positions at Illinois Sta
 te University (2018-2023) and Vanderbilt University (2015-2018). Her resea
 rch interests are centered around Graph Theory and Combinatorics\, particu
 larly focusing on structural graph theory and graph edge colorings. Shan h
 as authored over 40 papers\, primarily published in renowned journals such
  as the Journal of Graph Theory and the Journal of Combinatorial Theory\, 
 Series B.\n\nHost: Mark Grinshpon (mgrinshpon@gsu.edu)
GEO:33.754711;-84.388068
LOCATION:25 Park Place Building (SunTrust Tower)\, 1441
SUMMARY:Colloquium: Overfull Conjecture and Multigraph Overfull Conjecture
URL;VALUE=URI:https://calendar.gsu.edu/event/colloquium-overfull-conjecture
 -and-multigraph-overfull-conjecture
CATEGORIES:Lecture
END:VEVENT
END:VCALENDAR