\magnification=1440
\font\bigtenrm=cmr10 scaled\magstep4
Abstract for Asad Ali Ali and William Staton,
On Extremal Graphs With No Long Paths

Connected graphs with minimum degree $\delta$ and
at least $2\delta + 1$ vertices have paths with at
least $2\delta + 1$ vertices. We provide a characterization
of all such graphs which have no longer paths.


\bye


.
