Erdos-Gallai path edge bound

An $n$-vertex graph containing no path of length $t$ has at most $(t-1)n/2$ edges.