Nika Salia

According to our database, Nika Salia authored at least 24 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

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., January, 2024

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

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., December, 2023

Turán Problems for k-Geodetic Digraphs.

James Tuite, Grahame Erskine, Nika Salia

Graphs Comb., April, 2023

Turán numbers of Berge trees.

Ervin Györi, Nika Salia, Casey Tompkins, Oscar Zamora

Discret. Math., April, 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

Subgraph Densities in $K_r$-Free Graphs.

Andrzej Grzesik, Ervin Györi, Nika Salia, Casey Tompkins

Electron. J. Comb., 2023

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

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

J. Graph Theory, 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

J. Graph Theory, 2022

Inverse Turán numbers.

Ervin Györi, Nika Salia, Casey Tompkins, Oscar Zamora

Discret. Math., 2022

2021

The structure of hypergraphs without long Berge cycles.

Ervin Györi, Nathan Lemons, Nika Salia, Oscar Zamora

J. Comb. Theory, Ser. B, 2021

Connected hypergraphs without long Berge-paths.

Ervin Györi, Nika Salia, Oscar Zamora

Eur. 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

Discret. Math., 2021

Generalized Planar Turán Numbers.

Ervin Györi, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora

Electron. J. Comb., 2021

2020

The maximum Wiener index of maximal planar graphs.

Debarun Ghosh, Ervin Györi, Addisu Paulos, Nika Salia, Oscar Zamora

J. Comb. Optim., 2020

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

Comb. Probab. Comput., 2020

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

An Erdős-Gallai type theorem for vertex colored graphs.

Nika Salia, Casey Tompkins, Oscar Zamora

Graphs Comb., 2019

The maximum number of P_ℓ copies in P_k-free graphs.

Ervin Györi, Nika Salia, Casey Tompkins, Oscar Zamora

Discret. Math. Theor. Comput. Sci., 2019

Ramsey Numbers of Berge-Hypergraphs and Related Structures.

Nika Salia, Casey Tompkins, Zhiyu Wang, Oscar Zamora

Electron. J. Comb., 2019

2018

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

2017

A note on the maximum number of triangles in a C₅-free graph.

Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia

Electron. Notes Discret. Math., 2017

2013

Numerical comparison of different algorithms for construction of wavelet matrices.

Nika Salia, Alexander Gamkrelidze, Lasha Ephremidze

Proceedings of the First International Black Sea Conference on Communications and Networking, 2013