Learn More
The Turán number of an r-uniform hypergraph H is the maximum number of edges in any r-graph on n vertices which does not contain H as a subgraph. Let P (r) denote the family of r-uniform loose paths on edges, F (k, l) denote the family of hypergraphs consisting of k disjoint paths from P (r) denote an r-uniform linear path on edges. We determine precisely(More)
  • 1