Numerical comparison of different algorithms for construction of wavelet matrices. - Nika Salia; Alexander Gamkrelidze; Lasha Ephremidze (BlackSeaCom, 2013)

A note on the maximum number of triangles in a C5-free graph. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku; Nika Salia (Electron. Notes Discret. Math., 2017)

On the maximum size of connected hypergraphs without a path of given length. - Ervin Györi; Abhishek Methuku; Nika Salia; Casey Tompkins; Máté Vizer (Discret. Math., 2018)

Ramsey Numbers of Berge-Hypergraphs and Related Structures. - Nika Salia; Casey Tompkins; Zhiyu Wang; Oscar Zamora 001 (Electron. J. Comb., 2019)

The maximum number of Pℓ copies in Pk-free graphs. - Ervin Györi; Nika Salia; Casey Tompkins; Oscar Zamora 001 (Discret. Math. Theor. Comput. Sci., 2019)

An Erdős-Gallai type theorem for vertex colored graphs. - Nika Salia; Casey Tompkins; Oscar Zamora 001 (Graphs Comb., 2019)

A note on the maximum number of triangles in a C5-free graph. - Beka Ergemlidze; Abhishek Methuku; Nika Salia; Ervin Györi (J. Graph Theory, 2019)

Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku; Nika Salia; Casey Tompkins; Oscar Zamora 001 (Comb. Probab. Comput., 2020)

The maximum Wiener index of maximal planar graphs. - Debarun Ghosh; Ervin Györi; Addisu Paulos; Nika Salia; Oscar Zamora 001 (J. Comb. Optim., 2020)

Generalized Planar Turán Numbers. - Ervin Györi; Addisu Paulos; Nika Salia; Casey Tompkins; Oscar Zamora 001 (Electron. J. Comb., 2021)

The maximum number of paths of length four in a planar graph. - Debarun Ghosh; Ervin Györi; Ryan R. Martin; Addisu Paulos; Nika Salia; Chuanqi Xiao; Oscar Zamora 001 (Discret. Math., 2021)

Connected hypergraphs without long Berge-paths. - Ervin Györi; Nika Salia; Oscar Zamora 001 (Eur. J. Comb., 2021)

The structure of hypergraphs without long Berge cycles. - Ervin Györi; Nathan Lemons; Nika Salia; Oscar Zamora 001 (J. Comb. Theory B, 2021)

Inverse Turán numbers. - Ervin Györi; Nika Salia; Casey Tompkins; Oscar Zamora 001 (Discret. Math., 2022)

The maximum number of induced C 5 's in a planar graph. - Debarun Ghosh; Ervin Györi; Oliver Janzer; Addisu Paulos; Nika Salia; Oscar Zamora 001 (J. Graph Theory, 2022)

The maximum number of paths of length three in a planar graph. - Andrzej Grzesik; Ervin Györi; Addisu Paulos; Nika Salia; Casey Tompkins; Oscar Zamora 001 (J. Graph Theory, 2022)

On $3$-uniform hypergraphs avoiding a cycle of length four. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku; Nika Salia; Casey Tompkins (Electron. J. Comb., 2023)

Subgraph Densities in $K_r$-Free Graphs. - Andrzej Grzesik; Ervin Györi; Nika Salia; Casey Tompkins (Electron. J. Comb., 2023)

On the Small Quasi-kernel conjecture. - Péter L. Erdös; Ervin Györi; Tamás Róbert Mezei; Nika Salia; Mykhaylo Tyomkyn (CoRR, 2023)

Turán numbers of Berge trees. - Ervin Györi; Nika Salia; Casey Tompkins; Oscar Zamora 001 (Discret. Math., 2023)

Turán Problems for k-Geodetic Digraphs. - James Tuite; Grahame Erskine; Nika Salia (Graphs Comb., 2023)

Edges Not Covered by Monochromatic Bipartite Graph. - Xiutao Zhu; Ervin Györi; Zhen He; Zequn Lv; Nika Salia; Casey Tompkins; Kitti Varga (SIAM J. Discret. Math., 2023)

Extremal Results for Graphs Avoiding a Rainbow Subgraph. - Zhen He; Peter Frankl; Ervin Györi; Zequn Lv; Nika Salia; Casey Tompkins; Kitti Varga; Xiutao Zhu (Electron. J. Comb., 2024)

Pósa-Type Results for Berge Hypergraphs. - Nika Salia (Electron. J. Comb., 2024)

Stability of extremal connected hypergraphs avoiding Berge-paths. - Dániel Gerbner; Dániel T. Nagy; Balázs Patkós; Nika Salia; Máté Vizer (Eur. J. Comb., 2024)

How connectivity affects the extremal number of trees. - Suyun Jiang; Hong Liu; Nika Salia (J. Comb. Theory B, 2024)

The maximum number of copies of an even cycle in a planar graph. - Zequn Lv; Ervin Györi; Zhen He; Nika Salia; Casey Tompkins; Xiutao Zhu (J. Comb. Theory B, 2024)

Generalized Turán numbers for the edge blow-up of a graph. - Zequn Lv; Ervin Györi; Zhen He; Nika Salia; Casey Tompkins; Kitti Varga; Xiutao Zhu (Discret. Math., 2024)

On the Small Quasi-kernel Conjecture - A Survey. - Péter L. Erdös; Ervin Györi; Tamás Róbert Mezei; Nika Salia; Mykhaylo Tyomkyn (Information Theory and Related Fields, 2025)

A note on universal graphs for spanning trees. - Ervin Györi; Binlong Li; Nika Salia; Casey Tompkins (Discret. Appl. Math., 2025)

Intersecting families of polynomials over finite fields. - Nika Salia; Dávid Tóth (Finite Fields Their Appl., 2025)

Linear three-uniform hypergraphs with no Berge path of given length. - Ervin Györi; Nika Salia (J. Comb. Theory B, 2025)

The maximum number of pentagons in a planar graph. - Ervin Györi; Addisu Paulos; Nika Salia; Casey Tompkins; Oscar Zamora 001 (J. Graph Theory, 2025)

On graphs without cycles of length 0 modulo 4. - Ervin Györi; Binlong Li; Nika Salia; Casey Tompkins; Kitti Varga; Manran Zhu (J. Comb. Theory B, 2026)