#### Filter Results:

#### Publication Year

2011

2015

#### Publication Type

#### Co-author

#### Publication Venue

Learn More

- NEAL BUSHAW
- 2011

The Turán number of a graph H is the maximum number of edges in any graph on n vertices which does not contain H as a subgraph. Let P l denote a path on l vertices, and k · P l denote k vertex disjoint copies of P l. We first determine ex(n, k · P 3), answering in the positive a conjecture of Gorgol. Further, we determine ex (n, k · P l) for arbitrary l,… (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
- ›