default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCasey Tompkins
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j40]Zhen He, Peter Frankl, Ervin Györi, Zequn Lv, Nika Salia
, Casey Tompkins, Kitti Varga, Xiutao Zhu:
Extremal Results for Graphs Avoiding a Rainbow Subgraph. Electron. J. Comb. 31(1) (2024)- [j39]Zequn Lv, Ervin Györi, Zhen He, Nika Salia, Casey Tompkins, Kitti Varga, Xiutao Zhu:
Generalized Turán numbers for the edge blow-up of a graph. Discret. Math. 347(1): 113682 (2024) - [j38]Zequn Lv, Ervin Györi, Zhen He, Nika Salia, Casey Tompkins, Xiutao Zhu:
The maximum number of copies of an even cycle in a planar graph. J. Comb. Theory B 167: 15-22 (2024) - [j37]Debsoumya Chakraborti, Kevin Hendrey, Ben Lund, Casey Tompkins:
Rainbow Saturation for Complete Graphs. SIAM J. Discret. Math. 38(1): 1090-1112 (2024) - 2023
- [j36]József Balogh, Ce Chen, Kevin Hendrey, Ben Lund, Haoran Luo, Casey Tompkins, Tuan Tran:
Maximal 3-Wise Intersecting Families. Comb. 43(6): 1045-1066 (2023) - [j35]Andrzej Grzesik, Ervin Györi, Nika Salia, Casey Tompkins:
Subgraph Densities in $K_r$-Free Graphs. Electron. J. Comb. 30(1) (2023) - [j34]Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins:
On $3$-uniform hypergraphs avoiding a cycle of length four. Electron. J. Comb. 30(4) (2023) - [j33]Maria Axenovich, Laurin Benz, David Offner, Casey Tompkins:
Generalized Turán densities in the hypercube. Discret. Math. 346(2): 113238 (2023) - [j32]Ervin Györi, Nika Salia, Casey Tompkins, Oscar Zamora:
Turán numbers of Berge trees. Discret. Math. 346(4): 113286 (2023) - [j31]J. Pascal Gollin, Kevin Hendrey, Abhishek Methuku, Casey Tompkins, Xin Zhang:
Counting cliques in 1-planar graphs. Eur. J. Comb. 109: 103654 (2023) - [j30]David Malec, Casey Tompkins:
Localized versions of extremal problems. Eur. J. Comb. 112: 103715 (2023) - [j29]Xiutao Zhu, Ervin Györi, Zhen He, Zequn Lv, Nika Salia, Casey Tompkins, Kitti Varga:
Edges Not Covered by Monochromatic Bipartite Graph. SIAM J. Discret. Math. 37(4): 2508-2522 (2023) - 2022
- [j28]Ervin Györi, Nika Salia, Casey Tompkins, Oscar Zamora:
Inverse Turán numbers. Discret. Math. 345(5): 112779 (2022) - [j27]Andrzej Grzesik, Ervin Györi, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora:
The maximum number of paths of length three in a planar graph. J. Graph Theory 101(3): 493-510 (2022) - 2021
- [j26]Ervin Györi, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora:
Generalized Planar Turán Numbers. Electron. J. Comb. 28(4) (2021) - [j25]Maria Axenovich, David Offner, Casey Tompkins:
Long path and cycle decompositions of even hypercubes. Eur. J. Comb. 95: 103320 (2021) - [j24]Gábor Damásdi, Balázs Keszegh, David Malec, Casey Tompkins, Zhiyu Wang, Oscar Zamora:
Saturation problems in the Ramsey theory of graphs, posets and point sets. Eur. J. Comb. 95: 103321 (2021) - [j23]Maria Axenovich, Casey Tompkins, Lea Weber:
Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs. J. Graph Theory 97(1): 34-46 (2021) - 2020
- [j22]Jimeng Xiao, Casey Tompkins:
On Forbidden Poset Problems in the Linear Lattice. Electron. J. Comb. 27(1): 1 (2020) - [j21]Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins, Oscar Zamora:
Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2. Comb. Probab. Comput. 29(3): 423-435 (2020) - [j20]Dániel Grósz, Abhishek Methuku, Casey Tompkins:
On subgraphs of C2k-free graphs and a problem of Kühn and Osthus. Comb. Probab. Comput. 29(3): 436-454 (2020) - [j19]Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Casey Tompkins, Chuanqi Xiao:
Set systems related to a house allocation problem. Discret. Math. 343(7): 111886 (2020) - [j18]Dániel Grósz, Abhishek Methuku, Casey Tompkins:
Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs. Eur. J. Comb. 88: 103109 (2020)
2010 – 2019
- 2019
- [j17]Nika Salia, Casey Tompkins, Zhiyu Wang, Oscar Zamora:
Ramsey Numbers of Berge-Hypergraphs and Related Structures. Electron. J. Comb. 26(4): 4 (2019) - [j16]Ervin Györi, Gyula Y. Katona, László F. Papp, Casey Tompkins:
The optimal pebbling number of staircase graphs. Discret. Math. 342(7): 2148-2157 (2019) - [j15]Ervin Györi, Nika Salia, Casey Tompkins, Oscar Zamora:
The maximum number of Pℓ copies in Pk-free graphs. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [j14]Nika Salia, Casey Tompkins, Oscar Zamora:
An Erdős-Gallai type theorem for vertex colored graphs. Graphs Comb. 35(3): 689-694 (2019) - [j13]Gábor Bacsó, Csilla Bujtás, Casey Tompkins, Zsolt Tuza:
Disjoint Paired-Dominating sets in Cubic Graphs. Graphs Comb. 35(5): 1129-1138 (2019) - 2018
- [j12]Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins, Máté Vizer:
On the maximum size of connected hypergraphs without a path of given length. Discret. Math. 341(9): 2602-2605 (2018) - [j11]Akbar Davoodi, Ervin Györi, Abhishek Methuku, Casey Tompkins:
An Erdős-Gallai type theorem for uniform hypergraphs. Eur. J. Comb. 69: 159-162 (2018) - [j10]Ervin Györi, Dániel Korándi, Abhishek Methuku, István Tomon, Casey Tompkins, Máté Vizer:
On the Turán number of some ordered even cycles. Eur. J. Comb. 73: 81-88 (2018) - [j9]Dániel Grósz, Abhishek Methuku, Casey Tompkins:
An upper bound on the size of diamond-free families of sets. J. Comb. Theory A 156: 164-194 (2018) - [j8]Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber:
Intersection Graphs of Rays and Grounded Segments. J. Graph Algorithms Appl. 22(2): 273-295 (2018) - 2017
- [j7]Pierre Aboulker, Guillaume Lagarde, David Malec, Abhishek Methuku, Casey Tompkins:
De Bruijn-Erdős-type theorems for graphs and posets. Discret. Math. 340(5): 995-999 (2017) - [j6]Dániel Grósz, Abhishek Methuku, Casey Tompkins:
On subgraphs of C2k-free graphs. Electron. Notes Discret. Math. 61: 521-526 (2017) - [j5]Dániel Grósz, Abhishek Methuku, Casey Tompkins:
Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs. Electron. Notes Discret. Math. 61: 527-533 (2017) - [j4]Dániel Gerbner, Abhishek Methuku, Casey Tompkins:
Intersecting P-free families. J. Comb. Theory A 151: 61-83 (2017) - [j3]Dániel Grósz, Abhishek Methuku, Casey Tompkins:
An Improvement of the General Bound on the Largest Family of Subsets Avoiding a Subposet. Order 34(1): 113-125 (2017) - [c1]Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber:
Intersection Graphs of Rays and Grounded Segments. WG 2017: 153-166 - 2016
- [j2]Ervin Györi, Scott Kensell, Casey Tompkins:
Making a C6-free graph C4-free and bipartite. Discret. Appl. Math. 209: 133-136 (2016) - [i1]Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber:
Intersection Graphs of Rays and Grounded Segments. CoRR abs/1612.03638 (2016) - 2015
- [j1]Abhishek Methuku, Casey Tompkins:
Exact Forbidden Subposet Results using Chain Decompositions of the Cycle. Electron. J. Comb. 22(4): 4 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
