Casey Tompkins

Orcid: 0000-0003-2618-0604

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Rainbow Saturation for Complete Graphs.
SIAM J. Discret. Math., March, 2024

Generalized Turán numbers for the edge blow-up of a graph.
Discret. Math., January, 2024

The maximum number of copies of an even cycle in a planar graph.
J. Comb. Theory B, 2024

Extremal Results for Graphs Avoiding a Rainbow Subgraph.
Electron. J. Comb., 2024

2023
Edges Not Covered by Monochromatic Bipartite Graph.
SIAM J. Discret. Math., December, 2023

Maximal 3-Wise Intersecting Families.
Comb., December, 2023

Localized versions of extremal problems.
Eur. J. Comb., August, 2023

Turán numbers of Berge trees.
Discret. Math., April, 2023

Counting cliques in 1-planar graphs.
Eur. J. Comb., 2023

Generalized Turán densities in the hypercube.
Discret. Math., 2023

Subgraph Densities in $K_r$-Free Graphs.
Electron. J. Comb., 2023

On $3$-uniform hypergraphs avoiding a cycle of length four.
Electron. J. Comb., 2023

2022
The maximum number of paths of length three in a planar graph.
J. Graph Theory, 2022

Inverse Turán numbers.
Discret. Math., 2022

2021
Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs.
J. Graph Theory, 2021

Saturation problems in the Ramsey theory of graphs, posets and point sets.
Eur. J. Comb., 2021

Long path and cycle decompositions of even hypercubes.
Eur. J. Comb., 2021

Generalized Planar Turán Numbers.
Electron. J. Comb., 2021

2020
Set systems related to a house allocation problem.
Discret. Math., 2020

On subgraphs of C2k-free graphs and a problem of Kühn and Osthus.
Comb. Probab. Comput., 2020

Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2.
Comb. Probab. Comput., 2020

On Forbidden Poset Problems in the Linear Lattice.
Electron. J. Comb., 2020

2019
An Erdős-Gallai type theorem for vertex colored graphs.
Graphs Comb., 2019

Disjoint Paired-Dominating sets in Cubic Graphs.
Graphs Comb., 2019

The maximum number of P<sub>ℓ</sub> copies in P<sub>k</sub>-free graphs.
Discret. Math. Theor. Comput. Sci., 2019

The optimal pebbling number of staircase graphs.
Discret. Math., 2019

Ramsey Numbers of Berge-Hypergraphs and Related Structures.
Electron. J. Comb., 2019

2018
Intersection Graphs of Rays and Grounded Segments.
J. Graph Algorithms Appl., 2018

An upper bound on the size of diamond-free families of sets.
J. Comb. Theory A, 2018

On the Turán number of some ordered even cycles.
Eur. J. Comb., 2018

An Erdős-Gallai type theorem for uniform hypergraphs.
Eur. J. Comb., 2018

On the maximum size of connected hypergraphs without a path of given length.
Discret. Math., 2018

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

Intersecting P-free families.
J. Comb. Theory A, 2017

Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs.
Electron. Notes Discret. Math., 2017

On subgraphs of C<sub>2k</sub>-free graphs.
Electron. Notes Discret. Math., 2017

De Bruijn-Erdős-type theorems for graphs and posets.
Discret. Math., 2017

2016
Making a C<sub>6</sub>-free graph C<sub>4</sub>-free and bipartite.
Discret. Appl. Math., 2016

2015
Exact Forbidden Subposet Results using Chain Decompositions of the Cycle.
Electron. J. Comb., 2015


  Loading...