BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: The clique complex of a graph is a simplicial complex with a s
 implex for each clique. Clique complexes are frequently being computed in a
 pplications of topology to data\, but we do not understand their algorithmi
 c theory or their mathematical theory. I will introduce clique complexes of
  graphs\, explain why applied topologists care about them\, and survey open
  problems about the topology of clique complexes of unit disk graphs\, powe
 rs of lattice graphs\, and powers of hypercube graphs. 
DTSTAMP:20211117T132100
DTSTART:20211129T141500
CLASS:PUBLIC
LOCATION:Freie Universität Berlin \n Institut für Informatik \n Takustr. 9 
 \n 14195 Berlin \n Room 005 (Ground Floor)\n 
SEQUENCE:0
SUMMARY:Henry Adams (Institute of Science and Technology Austria): Open que
 stions on clique complexes of graphs
UID:107919520@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/en/facetsofcomplexity/monday/20211129-L-Ada
 ms.html
END:VEVENT
END:VCALENDAR