Wednesday, February 20, 2019, 2:00 pm
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