BEGIN:VCALENDAR
CALSCALE:GREGORIAN
VERSION:2.0
METHOD:PUBLISH
PRODID:-//Drupal iCal API//EN
X-WR-TIMEZONE:America/New_York
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
DTSTART:20070311T020000
TZNAME:EDT
TZOFFSETTO:-0400
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
DTSTART:20071104T020000
TZNAME:EST
TZOFFSETTO:-0500
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
SEQUENCE:1
X-APPLE-TRAVEL-ADVISORY-BEHAVIOR:AUTOMATIC
UID:239641
DTSTAMP:20260727T101151Z
DTSTART;TZID=America/New_York:20260730T140000
DTEND;TZID=America/New_York:20260730T145000
URL;TYPE=URI:https://wpiedudev.wpi.edu/news/calendar/events/department-math
 ematical-sciences-discrete-math-seminar-martin-milanic-university-primorsk
 a-slovenia
SUMMARY:Department of Mathematical Sciences Discrete Math Seminar: Martin M
 ilanič\, University of Primorska\, Slovenia
DESCRIPTION:Thursday\, July 30th\, 2026\n2:00pm – 2:50pm\nStratton Hall 3
 13\n\nSpeaker:Martin Milanič\, University of Primorska\, Slovenia\nTitle:
 Linear colorings of graphs\nAbstract: How many colors are needed to color 
 the vertices of a graph so that each connected subgraph admits a color tha
 t appears exactly once? What if this requirement is relaxed to paths only?
  The corresponding two graph parameters were studied in the literature und
 er different names\, including centered and linear chromatic number\, resp
 ectively. In 2021\, Kun\, O'Brien\, Pilipczuk\, and Sullivan proved that t
 he two parameters are polynomially related and conjectured that they never
  differ more than by a factor of 2. We investigate the properties of linea
 r chromatic number and provide improved bounds in several graph classes.\n
 Joint work with Claire Hilaire (Clermont-Auvergne)\, Matjaž Krnc (Primors
 ka) and Jean-Florent Raymond (CNRS\, ENS de Lyon).
END:VEVENT
END:VCALENDAR
