Erdos-Gallai path edge bound
= Erdős-Gallai path edge bound
{c}
An $n$-vertex graph containing no path of length $t$ has at most $(t-1)n/2$ edges.
This path-length bound is a different result from the <Erdős-Gallai theorem> on degree sequences.
= Erdős-Gallai path edge bound
{c}
An $n$-vertex graph containing no path of length $t$ has at most $(t-1)n/2$ edges.
This path-length bound is a different result from the <Erdős-Gallai theorem> on degree sequences.