BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20260329T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20251026T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260416T222457Z
UID:1773154800@ist.ac.at
DTSTART:20260310T160000
DTEND:20260310T170000
DESCRIPTION:Speaker: János Pach\nhosted by Matthew Kwan\nAbstract: The cro
 ssing number cr(G) of a graph G\, is defined as the smallest number of 
 crossing points between the edges of G in the best drawing of G in the
  plane. There is another\, equally natural\, parameter: the pair-crossing 
 number\, denoted by pair-cr(G). This is the smallest number of crossing p
 airs of edges in an optimal drawing. Obviously\, we have pair-cr(G)≤cr(
 G)\, for every graph G. But are these two numbers always equal? 
LOCATION:Raiffeisen Lecture Hall\, Central Building\, ISTA
ORGANIZER:Stephanie.Dolot@ist.ac.at
SUMMARY:János Pach: The crossing number conundrum
URL:https://talks-calendar.ista.ac.at/events/6332
END:VEVENT
END:VCALENDAR