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

2 papers · 1 filter

math.CO2014

Exact forbidden subposet results using Chain decompositions of the Cycle

Abhishek Methuku, Casey Tompkins

We introduce a method of decomposing the family of intervals along a cyclic permutation into chains to determine the size of the largest family of subsets of $[n] := {1, 2, ..., n}$ …

math.CO2014★ 21 cited

An improvement of the general bound on the largest family of subsets avoiding a subposet

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

Let $L a (n, P)$ be the maximum size of a family of subsets of $[n] = {1, 2, ..., n}$ not containing $P$ as a (weak) subposet, and let $h (P)$ be the length of a longest chain in $P$ .…