BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: The combinatorial diameter of a simplicial complex is the diam
 eter of its dual graph. Using a probabilistic approach we determine the rig
 ht first-order asymptotics for the maximum possible diameter among all d-co
 mplexes on n vertices as well as among all d-pseudomanifolds on n vertices.
  This is joint work with Tom Bohman. 
DTSTAMP:20220426T233200
DTSTART:20220509T141500
CLASS:PUBLIC
LOCATION:Freie Universität Berlin \n Institut für Informatik \n Takustr. 9 
 \n 14195 Berlin \n Room 005 (Ground Floor)
SEQUENCE:0
SUMMARY:Andrew Newman (Carnegie Mellon University\, Pittsburgh): Complexes 
 of nearly maximum diameter
UID:107920284@www.facetsofcomplexity.de
URL:http://www.facetsofcomplexity.de/monday/20220509-L-Newman.html
END:VEVENT
END:VCALENDAR