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

3 papers · 1 filter

math.CO2021★ 1 cited

Maximal $3$ -wise intersecting families

József Balogh, Ce Chen, Kevin Hendrey +4

A family $F$ on ground set $[n] := {1, 2, \dots, n}$ is maximal $k$ -wise intersecting if every collection of at most $k$ sets in $F$ has non-empty intersection,…

math.CO2021

Counting cliques in $1$ -planar graphs

J. Pascal Gollin, Kevin Hendrey, Abhishek Methuku +2

The problem of maximising the number of cliques among $n$ -vertex graphs from various graph classes has received considerable attention. We investigate this problem for the class of…

math.CO2021

Ramsey numbers of Boolean lattices

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

The poset Ramsey number $R (Q_{m}, Q_{n})$ is the smallest integer $N$ such that any blue-red coloring of the elements of the Boolean lattice $Q_{N}$ has a blue induced copy of $Q_{m}$ or a…

Maximal 3-wise intersecting families

Counting cliques in 1-planar graphs

Ramsey numbers of Boolean lattices

Maximal $3$ -wise intersecting families

Counting cliques in $1$ -planar graphs