BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:24c201aa-446b-42b8-bb47-a3c447e3af68
X-WR-CALNAME:[gt.go] - 'On asymptotic packing of geometric graphs' by Alexa
 ndra Wesolek
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20240331T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20211031T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20221030T030000
RDATE:20231029T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20220327T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20230326T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:24c201aa-446b-42b8-bb47-a3c447e3af68
DTSTAMP:20260409T161516Z
CLASS:PUBLIC
DESCRIPTION:(Uniquement en présentiel / Only offline\, no online version) 
 \n\nA geometric graph G is a graph drawn in the Euclidean plane such that 
 its vertices are points in general position and its edges are drawn as str
 aight line segments. Given a complete geometric graph H_n on n vertices\, 
 we are interested in finding a large collection of plane copies of a graph
  G in H_n such that each edge of H_n appears in at most one copy of G. We 
 say a graph G is geometric-packable if for every sequence of geometric com
 plete graphs $(H_n)_{n \geq 1}$ all but o(n^2) edges of H_n can be packed 
 by plane copies of G. In a joint work with Daniel W. Cranston\, Jiaxi Nie 
 and Jacques Verstraete\, we study geometric-packability and show that if G
  is a triangle\, plane 4-cycle or plane 4-cycle with a chord\, the set of 
 plane drawings of G is geometric-packable. In contrast\, the analogous sta
 tement is false when G is nearly any other planar Hamiltonian graph (with 
 at most 3 possible exceptions). \n\n[Alexandra Wesolek] (Simon Fraser Univ
 ersity\, Canada) \n\nhttp://www.sfu.ca/~agwesole/ \n\nRemarks / Remarques 
 \n\nFind all the information of the working group on this [ https://graphe
 setoptimisation.labri.fr/pmwiki.php/Groupe/GT?userlang=en | web page ] . 
 \nRetrouvez toutes les informations du GT sur cette [ https://graphesetopt
 imisation.labri.fr/pmwiki.php/Groupe/GT | page web ] .
DTSTART;TZID=Europe/Paris:20220520T140000
DTEND;TZID=Europe/Paris:20220520T150000
LOCATION:LaBRI (178)
SEQUENCE:0
SUMMARY:[gt.go] - 'On asymptotic packing of geometric graphs' by Alexandra 
 Wesolek
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
