#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2011

2017

- This year (1)
- Last 5 years (3)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Neal Bushaw, Nathan Kettle
- Combinatorics, Probability & Computing
- 2011

- Neal Bushaw, Nathan Kettle
- SIAM J. Discrete Math.
- 2014

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 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 , and L (r) denote an r-uniform linear path on edges. We determine… (More)

- József Balogh, Neal Bushaw, Maurício Collares Neto, Hong Liu, Robert Morris, Maryam Sharifzadeh
- Combinatorica
- 2017

In 1987, Kolaitis, Prömel and Rothschild proved that, for every fixed r ∈ N, almost every n-vertex Kr+1-free graph is r-partite. In this paper we extend this result to all functions r = r(n) with r 6 (log n). The proof combines a new (close to sharp) supersaturation version of the Erdős–Simonovits stability theorem, the hypergraph container method, and a… (More)

- Neal Bushaw, Maurício Collares Neto, Robert Morris, Paul Smith
- Combinatorics, Probability & Computing
- 2015

- ‹
- 1
- ›