default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOscar Zamora 0001
Person information
- affiliation: University of Costa Rica, San José, Costa Rica
- affiliation: Central European University, Budapest, Hungary
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j19]Ervin Györi
, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora:
The maximum number of pentagons in a planar graph. J. Graph Theory 108(2): 229-256 (2025)- 2024
- [j18]Debarun Ghosh, Ervin Györi, Judit Nagy-György, Addisu Paulos, Chuanqi Xiao, Oscar Zamora:
Book free 3-uniform hypergraphs. Discret. Math. 347(3): 113828 (2024) - 2023
- [j17]Ervin Györi, Nika Salia, Casey Tompkins, Oscar Zamora:
Turán numbers of Berge trees. Discret. Math. 346(4): 113286 (2023) - 2022
- [j16]Chuanqi Xiao, Gyula O. H. Katona, Jimeng Xiao, Oscar Zamora:
The Turán number of the square of a path. Discret. Appl. Math. 307: 1-14 (2022) - [j15]Debarun Ghosh, Ervin Györi, Addisu Paulos, Chuanqi Xiao, Oscar Zamora:
The Turán number of the triangular pyramid of 3-layers. Discret. Appl. Math. 317: 75-85 (2022) - [j14]Ervin Györi, Nika Salia, Casey Tompkins, Oscar Zamora:
Inverse Turán numbers. Discret. Math. 345(5): 112779 (2022) - [j13]Debarun Ghosh, Ervin Györi, Oliver Janzer, Addisu Paulos, Nika Salia, Oscar Zamora:
The maximum number of induced C 5 's in a planar graph. J. Graph Theory 99(3): 378-398 (2022) - [j12]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
- [j11]Ervin Györi, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora:
Generalized Planar Turán Numbers. Electron. J. Comb. 28(4) (2021) - [j10]Debarun Ghosh, Ervin Györi, Ryan R. Martin, Addisu Paulos, Nika Salia, Chuanqi Xiao, Oscar Zamora:
The maximum number of paths of length four in a planar graph. Discret. Math. 344(5): 112317 (2021) - [j9]Chuanqi Xiao, Oscar Zamora:
A note on the Turán number of disjoint union of wheels. Discret. Math. 344(11): 112570 (2021) - [j8]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) - [j7]Ervin Györi, Nika Salia, Oscar Zamora:
Connected hypergraphs without long Berge-paths. Eur. J. Comb. 96: 103353 (2021) - [j6]Ervin Györi, Nathan Lemons, Nika Salia, Oscar Zamora:
The structure of hypergraphs without long Berge cycles. J. Comb. Theory B 148: 239-250 (2021) - 2020
- [j5]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) - [j4]Debarun Ghosh, Ervin Györi, Addisu Paulos, Nika Salia, Oscar Zamora:
The maximum Wiener index of maximal planar graphs. J. Comb. Optim. 40(4): 1121-1135 (2020)
2010 – 2019
- 2019
- [j3]Nika Salia, Casey Tompkins, Zhiyu Wang, Oscar Zamora:
Ramsey Numbers of Berge-Hypergraphs and Related Structures. Electron. J. Comb. 26(4): 4 (2019) - [j2]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) - [j1]Nika Salia, Casey Tompkins, Oscar Zamora:
An Erdős-Gallai type theorem for vertex colored graphs. Graphs Comb. 35(3): 689-694 (2019)
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 2025-01-26 23:48 CET 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:
