Ask a Question

Prefer a chat interface with context about you and your work?

On Extremal Graphs With No Long Paths

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.