default search action
Nika Salia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j26]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) - [j25]Nika Salia:
Pósa-Type Results for Berge Hypergraphs. Electron. J. Comb. 31(2) (2024) - [j24]Zequn Lv, Ervin Györi, Zhen He
Generalized Turán numbers for the edge blow-up of a graph. Discret. Math. 347(1): 113682 (2024) - [j23]Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Nika Salia
Stability of extremal connected hypergraphs avoiding Berge-paths. Eur. J. Comb. 118: 103930 (2024) - [j22]Suyun Jiang
How connectivity affects the extremal number of trees. J. Comb. Theory B 167: 1-14 (2024) - [j21]Zequn Lv, Ervin Györi, Zhen He, Nika Salia
The maximum number of copies of an even cycle in a planar graph. J. Comb. Theory B 167: 15-22 (2024) - 2023
- [j20]Andrzej Grzesik, Ervin Györi, Nika Salia
Subgraph Densities in $K_r$-Free Graphs. Electron. J. Comb. 30(1) (2023) - [j19]Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia
On $3$-uniform hypergraphs avoiding a cycle of length four. Electron. J. Comb. 30(4) (2023) - [j18]Ervin Györi, Nika Salia
Turán numbers of Berge trees. Discret. Math. 346(4): 113286 (2023) - [j17]James Tuite
Turán Problems for k-Geodetic Digraphs. Graphs Comb. 39(2): 25 (2023) - [j16]Xiutao Zhu, Ervin Györi, Zhen He
Edges Not Covered by Monochromatic Bipartite Graph. SIAM J. Discret. Math. 37(4): 2508-2522 (2023) - [i2]Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, Nika Salia
On the Small Quasi-kernel conjecture. CoRR abs/2307.04112 (2023) - 2022
- [j15]Ervin Györi, Nika Salia
Inverse Turán numbers. Discret. Math. 345(5): 112779 (2022) - [j14]Debarun Ghosh, Ervin Györi
The maximum number of induced C 5 's in a planar graph. J. Graph Theory 99(3): 378-398 (2022) - [j13]Andrzej Grzesik
The maximum number of paths of length three in a planar graph. J. Graph Theory 101(3): 493-510 (2022) - 2021
- [j12]Ervin Györi, Addisu Paulos, Nika Salia
Generalized Planar Turán Numbers. Electron. J. Comb. 28(4) (2021) - [j11]Debarun Ghosh
The maximum number of paths of length four in a planar graph. Discret. Math. 344(5): 112317 (2021) - [j10]Ervin Györi, Nika Salia
Connected hypergraphs without long Berge-paths. Eur. J. Comb. 96: 103353 (2021) - [j9]Ervin Györi, Nathan Lemons, Nika Salia
The structure of hypergraphs without long Berge cycles. J. Comb. Theory B 148: 239-250 (2021) - 2020
- [j8]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) - [j7]Debarun Ghosh, Ervin Györi, Addisu Paulos, Nika Salia
The maximum Wiener index of maximal planar graphs. J. Comb. Optim. 40(4): 1121-1135 (2020)
2010 – 2019
- 2019
- [j6]Nika Salia
Ramsey Numbers of Berge-Hypergraphs and Related Structures. Electron. J. Comb. 26(4): 4 (2019) - [j5]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) - [j4]Nika Salia
An Erdős-Gallai type theorem for vertex colored graphs. Graphs Comb. 35(3): 689-694 (2019) - [j3]Beka Ergemlidze, Abhishek Methuku, Nika Salia
A note on the maximum number of triangles in a C5-free graph. J. Graph Theory 90(3): 227-230 (2019) - 2018
- [j2]Ervin Györi, Abhishek Methuku, Nika Salia
On the maximum size of connected hypergraphs without a path of given length. Discret. Math. 341(9): 2602-2605 (2018) - 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) - 2013
- [c1]Nika Salia
Numerical comparison of different algorithms for construction of wavelet matrices. BlackSeaCom 2013: 177-180 - 2012
- [i1]Nika Salia, Alexander Gamkrelidze, Lasha Ephremidze:
Numerical comparison of different algorithms for construction of wavelet matrices. CoRR abs/1211.4516 (2012)
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-10-07 21:18 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: