default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBeka Ergemlidze
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j17]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)- [j16]Beka Ergemlidze, Abhishek Methuku, Michael Tait, Craig Timmons:
Minimizing the number of complete bipartite graphs in a Ks-saturated graph. Discuss. Math. Graph Theory 43(3): 793-807 (2023) - 2022
- [j15]Beka Ergemlidze, Theodore Molla:
Transversal Ck-factors in subgraphs of the balanced blow-up of Ck. Comb. Probab. Comput. 31(6): 1031-1047 (2022) - [j14]Beka Ergemlidze, Abhishek Methuku:
Triangles in C 5 -free graphs and hypergraphs of girth six. J. Graph Theory 99(1): 26-39 (2022) - 2021
- [j13]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
The Exact Linear Turán Number of the Sail. Electron. J. Comb. 28(4) (2021) - [j12]Beka Ergemlidze:
A note on the maximum size of Berge-C4-free hypergraphs. Discret. Math. 344(4): 112262 (2021) - 2020
- [j11]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
3-Uniform Hypergraphs without a Cycle of Length Five. Electron. J. Comb. 27(2): 2 (2020) - [j10]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) - [j9]Beka Ergemlidze, Tao Jiang, Abhishek Methuku:
New bounds for a hypergraph bipartite Turán problem. J. Comb. Theory A 176: 105299 (2020)
2010 – 2019
- 2019
- [j8]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
On the Rainbow Turán number of paths. Electron. J. Comb. 26(1): 1 (2019) - [j7]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle. Comb. Probab. Comput. 28(2): 241-252 (2019) - [j6]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs. J. Comb. Theory A 163: 163-181 (2019) - [j5]Beka Ergemlidze, Abhishek Methuku, Nika Salia, Ervin Györi:
A note on the maximum number of triangles in a C5-free graph. J. Graph Theory 90(3): 227-230 (2019) - 2018
- [j4]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
A Note on the Linear Cycle Cover Conjecture of Gyárfás and Sárközy. Electron. J. Comb. 25(2): 2 (2018) - [j3]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
3-Uniform Hypergraphs and Linear Cycles. SIAM J. Discret. Math. 32(2): 933-950 (2018) - 2017
- [j2]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
3-uniform hypergraphs and linear cycles. Electron. Notes Discret. Math. 61: 391-394 (2017) - [j1]Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia:
A note on the maximum number of triangles in a C5-free graph. Electron. Notes Discret. Math. 61: 395-398 (2017)
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-06-10 21:21 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:
