Number of lines in hypergraphs

Chen and Chv'atal introduced the notion of lines in hypergraphs; they proved that every 3-uniform hypergraph with $n$ vertices either has a line that consists of all $n$ vertices or else has at least ${\log }_{2}n$ distinct lines. We improve this lower bound by a factor of $2-o(1)$.