On April 14, 2020, Casey Tompkins from IBS discrete mathematics group gave a talk on the saturation version of the problems related to the Erdős-Szekeres theorem on convex k-gons, sequences, and posets. The title of his talk is “Saturation problems in the Ramsey theory of graphs, posets and point sets“.
Casey Tompkins, Saturation problems in the Ramsey theory of graphs, posets and point sets
In 1964, Erdős, Hajnal and Moon introduced a saturation version of Turán’s classical theorem in extremal graph theory. In particular, they determined the minimum number of edges in a
We also consider semisaturation problems, wherein we allow the family to have the forbidden configuration, but insist that any addition to the family yields a new copy of the forbidden configuration. In this setting, we prove a semisaturation version of the Erdős-Szekeres theorem on convex
This project was joint work with Gábor Damásdi, Balázs Keszegh, David Malec, Zhiyu Wang and Oscar Zamora.
Casey Tompkins gave a talk on the extremal problems for Berge hypergraphs at the discrete math seminar
On October 1, 2019, Casey Tompkins at IBS discrete mathematics group presented a seminar talk on an extension of Turán’s theorem to hypergraphs. The title of his talk was “Extremal problems for Berge hypergraphs“.
Casey Tompkins, Extremal problems for Berge hypergraphs
Given a graph
Welcome Casey Tompkins, a new research fellow in the IBS discrete mathematics group

The IBS discrete mathematics group welcomes Dr. Casey Tompkins, a new research fellow at the IBS discrete mathematics group from September 1, 2019.
He received his Ph.D. from the Department of Mathematics at the Central European University in Budapest, Hungary in 2015 under the supervision of Prof. Gyula O. H. Katona.