Casey Tompkins

An upper bound on the size of diamond-free families of sets

Let

On the maximum size of connected hypergraphs without a path of given length

La(n,P)

Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs

be the maximum size of a family of subsets of

The optimal pebbling number of staircase graphs

[n]=\{1,2,...,n\}

On the Turán number of some ordered even cycles

not containing

On subgraphs of C 2k -free graphs

P

An Erd\H{o}s-Gallai type theorem for hypergraphs

as a (weak) subposet. The diamond poset, denoted

Ramsey numbers of Berge-hypergraphs and related structures

B_{2}

An Erdős–Gallai type theorem for uniform hypergraphs

, is defined on four elements

Avoiding long Berge cycles, the missing cases

x,y,z,w