Extensions of Erdős-Gallai Theorem and Luo's Theorem with Applications

Bo Ning, Xing Peng

The famous Erdős-Gallai Theorem on the Turán number of paths states that every graph with $n$ vertices and $m$ edges contains a path with at least $\frac{2m}{n}$ edges. In this not…