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 2022Show all

9 papers · 1 filter

math.CO2022★ 1 cited

Rainbow saturation for complete graphs

Debsoumya Chakraborti, Kevin Hendrey, Ben Lund +1

We call an edge-colored graph rainbow if all of its edges receive distinct colors. An edge-colored graph $Γ$ is called $H$ -rainbow saturated if $Γ$ does not contain a rainbow copy…

math.CO2022★ 1 cited

Edges not covered by monochromatic bipartite graphs

Xiutao Zhu, Ervin Győri, Zhen He +4

Let $f_{k} (n, H)$ denote the maximum number of edges not contained in any monochromatic copy of~ $H$ in a $k$ -coloring of the edges of $K_{n}$ , and let $e x (n, H)$ denote the Turán number…

math.CO2022

Generalized Turan number for the edge blow-up graph

Zequn Lv, Ervin Győri, Zhen He +4

Let $H$ be a graph and $p$ be an integer. The edge blow-up $H^{p}$ of $H$ is the graph obtained from replacing each edge in $H$ by a copy of $K_{p}$ where the new vertices of the cliqu…

math.CO2022

Exact results for generalized extremal problems forbidding an even cycle

Ervin Győri, Zhen He, Zequn Lv +4

We determine the maximum number of copies of $K_{s, s}$ in a $C_{2 s + 2}$ -free $n$ -vertex graph for all integers $s \geq 2$ and sufficiently large $n$ . Moreover, for $s \in {2, 3}$ and…

math.CO2022

The maximum number of copies of an even cycle in a planar graph

Zequn Lv, Ervin Győri, Zhen He +3

We resolve a conjecture of Cox and Martin by determining asymptotically for every $k \geq 2$ the maximum number of copies of $C_{2 k}$ in an $n$ -vertex planar graph.

math.CO2022

Localized versions of extremal problems

David Malec, Casey Tompkins

We generalize several classical theorems in extremal combinatorics by replacing a global constraint with an inequality which holds for all objects in a given class. In particular w…