BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: We discuss some notoriously hard combinatorial problems for la
 rge classes of graphs and hypergraphs arising in geometric\, algebraic\, an
 d practical applications. These structures are of bounded complexity: they 
 can be embedded in a bounded-dimensional space\, or have small VC-dimension
 \, or a short algebraic description. What are the advantages of low complex
 ity? I will suggest a few possible answers to this question\, and illustrat
 e them with classical examples. 
DTSTAMP:20220527T143400
DTSTART:20220530T141500
CLASS:PUBLIC
LOCATION:Chemistry building\n Arnimallee 22\n 14195 Berlin \n Hörsaal A
SEQUENCE:0
SUMMARY:János Pach (Rényi Institute\, Budapest): Facets of Simplicity
UID:126162535@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/math/dates/colloquium/2022/20220530-L-Pach.
 html
END:VEVENT
END:VCALENDAR