Casey Tompkins

According to our database, Casey Tompkins authored at least 39 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Rainbow Saturation for Complete Graphs.

Debsoumya Chakraborti, Kevin Hendrey, Ben Lund, Casey Tompkins

SIAM J. Discret. Math., March, 2024

Generalized Turán numbers for the edge blow-up of a graph.

Zequn Lv, Ervin Györi, Zhen He, Nika Salia, Casey Tompkins, Kitti Varga, Xiutao Zhu

Discret. Math., January, 2024

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

Zequn Lv, Ervin Györi, Zhen He, Nika Salia, Casey Tompkins, Xiutao Zhu

J. Comb. Theory B, 2024

Extremal Results for Graphs Avoiding a Rainbow Subgraph.

Zhen He, Peter Frankl, Ervin Györi, Zequn Lv, Nika Salia, Casey Tompkins, Kitti Varga, Xiutao Zhu

Electron. J. Comb., 2024

2023

Edges Not Covered by Monochromatic Bipartite Graph.

Xiutao Zhu, Ervin Györi, Zhen He, Zequn Lv, Nika Salia, Casey Tompkins, Kitti Varga

SIAM J. Discret. Math., December, 2023

Maximal 3-Wise Intersecting Families.

József Balogh, Ce Chen, Kevin Hendrey, Ben Lund, Haoran Luo, Casey Tompkins, Tuan Tran

Comb., December, 2023

Localized versions of extremal problems.

David Malec, Casey Tompkins

Eur. J. Comb., August, 2023

Turán numbers of Berge trees.

Ervin Györi, Nika Salia, Casey Tompkins, Oscar Zamora

Discret. Math., April, 2023

Counting cliques in 1-planar graphs.

J. Pascal Gollin, Kevin Hendrey, Abhishek Methuku, Casey Tompkins, Xin Zhang

Eur. J. Comb., 2023

Generalized Turán densities in the hypercube.

Maria Axenovich, Laurin Benz, David Offner, Casey Tompkins

Discret. Math., 2023

Subgraph Densities in $K_r$-Free Graphs.

Andrzej Grzesik, Ervin Györi, Nika Salia, Casey Tompkins

Electron. J. Comb., 2023

On $3$-uniform hypergraphs avoiding a cycle of length four.

Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins

Electron. J. Comb., 2023

2022

The maximum number of paths of length three in a planar graph.

Andrzej Grzesik, Ervin Györi, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora

J. Graph Theory, 2022

Inverse Turán numbers.

Ervin Györi, Nika Salia, Casey Tompkins, Oscar Zamora

Discret. Math., 2022

2021

Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs.

Maria Axenovich, Casey Tompkins, Lea Weber

J. Graph Theory, 2021

Saturation problems in the Ramsey theory of graphs, posets and point sets.

Gábor Damásdi, Balázs Keszegh, David Malec, Casey Tompkins, Zhiyu Wang, Oscar Zamora

Eur. J. Comb., 2021

Long path and cycle decompositions of even hypercubes.

Maria Axenovich, David Offner, Casey Tompkins

Eur. J. Comb., 2021

Generalized Planar Turán Numbers.

Ervin Györi, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora

Electron. J. Comb., 2021

2020

Set systems related to a house allocation problem.

Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Casey Tompkins, Chuanqi Xiao

Discret. Math., 2020

On subgraphs of C2k-free graphs and a problem of Kühn and Osthus.

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

Comb. Probab. Comput., 2020

Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2.

Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins, Oscar Zamora

Comb. Probab. Comput., 2020

On Forbidden Poset Problems in the Linear Lattice.

Jimeng Xiao, Casey Tompkins

Electron. J. Comb., 2020

2019

An Erdős-Gallai type theorem for vertex colored graphs.

Nika Salia, Casey Tompkins, Oscar Zamora

Graphs Comb., 2019

Disjoint Paired-Dominating sets in Cubic Graphs.

Gábor Bacsó, Csilla Bujtás, Casey Tompkins, Zsolt Tuza

Graphs Comb., 2019

The maximum number of P_ℓ copies in P_k-free graphs.

Ervin Györi, Nika Salia, Casey Tompkins, Oscar Zamora

Discret. Math. Theor. Comput. Sci., 2019

The optimal pebbling number of staircase graphs.

Ervin Györi, Gyula Y. Katona, László F. Papp, Casey Tompkins

Discret. Math., 2019

Ramsey Numbers of Berge-Hypergraphs and Related Structures.

Nika Salia, Casey Tompkins, Zhiyu Wang, Oscar Zamora

Electron. J. Comb., 2019

2018

Intersection Graphs of Rays and Grounded Segments.

Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber

J. Graph Algorithms Appl., 2018

An upper bound on the size of diamond-free families of sets.

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

J. Comb. Theory A, 2018

On the Turán number of some ordered even cycles.

Ervin Györi, Dániel Korándi, Abhishek Methuku, István Tomon, Casey Tompkins, Máté Vizer

Eur. J. Comb., 2018

An Erdős-Gallai type theorem for uniform hypergraphs.

Akbar Davoodi, Ervin Györi, Abhishek Methuku, Casey Tompkins

Eur. J. Comb., 2018

On the maximum size of connected hypergraphs without a path of given length.

Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins, Máté Vizer

Discret. Math., 2018

2017

An Improvement of the General Bound on the Largest Family of Subsets Avoiding a Subposet.

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

Order, 2017

Intersecting P-free families.

Dániel Gerbner, Abhishek Methuku, Casey Tompkins

J. Comb. Theory A, 2017

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

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

Electron. Notes Discret. Math., 2017

On subgraphs of C_2k-free graphs.

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

Electron. Notes Discret. Math., 2017

De Bruijn-Erdős-type theorems for graphs and posets.

Pierre Aboulker, Guillaume Lagarde, David Malec, Abhishek Methuku, Casey Tompkins

Discret. Math., 2017

2016

Making a C₆-free graph C₄-free and bipartite.

Ervin Györi, Scott Kensell, Casey Tompkins

Discret. Appl. Math., 2016

2015

Exact Forbidden Subposet Results using Chain Decompositions of the Cycle.

Abhishek Methuku, Casey Tompkins

Electron. J. Comb., 2015