In this paper, we prove a theorem on tight paths in convex geometric hypergraphs, which is asymptotically sharp in infinitely many cases. Our geometric theorem is a common generalization of early results of Hopf and Pannwitz , Sutherland , Kupitz and Perles  for convex geometric graphs, as well as the classical Erdős-Gallai Theorem  for graphs. As a consequence, we obtain the first substantial improvement on the Turán problem for tight paths in uniform hypergraphs.
- Convex geometric hypergraphs
- Turan number
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics