C. Tompkins

activity

20142023

most citedAn Erdős-Gallai type theorem for uniform hypergraphs

39 citations · 111 across the 33 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.CO2018

Ramsey numbers of Berge-hypergraphs and related structures

Nika Salia, Casey Tompkins, Zhiyu Wang +1

For a graph $G = (V, E)$ , a hypergraph $H$ is called a Berge- $G$ , denoted by $B G$ , if there exists a bijection $f : E (G) \to E (H)$ such that for every $e \in E (G)$ ,…

math.CO2018

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

Dániel Grósz, Abhishek Methuku, Casey Tompkins

Let $F = (U, E)$ be a graph and $H = (V, E)$ be a hypergraph. We say that $H$ contains a Berge- $F$ if there exist injections $ψ : U \to V$ and $φ:E\to \mat…

math.CO2018★ 6 cited

The maximum number of $P_{ℓ}$ copies in $P_{k}$ -free graphs

Ervin Győri, Nika Salia, Casey Tompkins +1

Generalizing Turán's classical extremal problem, Alon and Shikhelman investigated the problem of maximizing the number of $T$ copies in an $H$ -free graph, for a pair of graphs $T$ …

Ramsey numbers of Berge-hypergraphs and related structures

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

The maximum number of Pℓ​ copies in Pk​-free graphs

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

The maximum number of $P_{ℓ}$ copies in $P_{k}$ -free graphs