BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//hacksw/handcal//NONSGML v1.0//EN
BEGIN:VEVENT
UID:node-785@mathematics.ceu.edu
DTSTAMP:20190220T130000Z
DTSTART:20190220T130000Z
DTEND:20190220T130000Z
SUMMARY:Which HyperGraphs are Extremal?
DESCRIPTION: Abstract:A well-known theorem of Erdős and Gallai from 1959, asserts that a graph with no path of length k contains at most \frac{(k−1)n}{2} edges and a graph with no cycle of length at least k contains at most \frac{(k-1)(n-1)}{2} edges. We will discuss extensions of this results for hypergraphs - http://mathematics.ceu.edu/events/2019-02-20/which-hypergraphs-are-extremal
LOCATION:310/A
END:VEVENT
END:VCALENDAR