On the minimal length of the longest trail in a fixed edge-density graph

Abstract

A nearly sharp lower bound on the length of the longest trail in a graph on n vertices and average degree k is given provided the graph is dense enough (k ≥ 12.5).