Minimum degree of 3-graphs without long linear paths

Yue Ma, Xinmin Hou, Jun Gao

A well known theorem in graph theory states that every graph $G$ on $n$ vertices and minimum degree at least $d$ contains a path of length at least $d$, and if $G$ is connected and…