BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
X-WR-CALNAME:Combinatorics Seminar - Minimizing the edges of (H1\, . . . \,
  Hr)-co-critical graphs
X-WR-TIMEZONE:Central Time (US & Canada)
BEGIN:VEVENT
DTSTAMP:20260905T141714Z
UID:tag:localist.com\,2008:EventInstance_52509512063628
DTSTART:20260415T210000Z
DTEND:20260415T220000Z
DESCRIPTION:Zixia Song\n\nUniversity of Central Florida\n\n \n\nAbstract\n\
 nGiven an integer r ≥ 1 and graphs G\, H1\, . . . \, Hr\, we write G →
  (H1\, . . . \, Hr) if every r-coloring of the edges of G contains a monoc
 hromatic copy of Hi in color i for some i ∈ {1\, . . . \, r}. A non-comp
 lete graph G is (H1\, . . . \, Hr)-co-critical if G ↛ (H1\, . . . \, Hr)
 \, but G + e → (H1\, . . . \, Hr) for every edge e in the complement of 
 G. Motivated by Hanson and Toft’s conjecture\, we study the minimum numb
 er of edges over all (H1\, . . . \, Hr)-co-critical graphs on n vertices. 
 In this talk we will survey the history of (H1\, . . . \, Hr)-co-critical 
 graphs and discuss the main ideas of our recent results on co-critical gra
 phs.
LOCATION:Hume Hall\, 321
SUMMARY:Combinatorics Seminar - Minimizing the edges of (H1\, . . . \, Hr)-
 co-critical graphs
URL;VALUE=URI:https://eventcalendar.olemiss.edu/event/combinatorics-seminar
 -minimizing-the-edges-of-h1-hr-co-critical-graphs
CATEGORIES:Lectures
END:VEVENT
END:VCALENDAR