Nika Salia

Orcid: 0000-0003-3403-9686

According to our database¹, Nika Salia authored at least 31 papers between 2013 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2025

The maximum number of pentagons in a planar graph.

[BibT_eX]

[DOI]

J. Graph Theory, February, 2025

Linear three-uniform hypergraphs with no Berge path of given length.

[BibT_eX]

[DOI]

Ervin Györi

Nika Salia

J. Comb. Theory B, 2025

Intersecting families of polynomials over finite fields.

[BibT_eX]

[DOI]

Nika Salia

Dávid Tóth

Finite Fields Their Appl., 2025

2024

Generalized Turán numbers for the edge blow-up of a graph.

[BibT_eX]

[DOI]

Discret. Math., January, 2024

The maximum number of copies of an even cycle in a planar graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2024

How connectivity affects the extremal number of trees.

[BibT_eX]

[DOI]

Suyun Jiang

Hong Liu

Nika Salia

J. Comb. Theory B, 2024

Stability of extremal connected hypergraphs avoiding Berge-paths.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

Pósa-Type Results for Berge Hypergraphs.

[BibT_eX]

[DOI]

Nika Salia

Electron. J. Comb., 2024

Extremal Results for Graphs Avoiding a Rainbow Subgraph.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

2023

Edges Not Covered by Monochromatic Bipartite Graph.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., December, 2023

Turán Problems for k-Geodetic Digraphs.

[BibT_eX]

[DOI]

James Tuite

Grahame Erskine

Nika Salia

Graphs Comb., April, 2023

Turán numbers of Berge trees.

[BibT_eX]

[DOI]

Discret. Math., April, 2023

On the Small Quasi-kernel conjecture.

[BibT_eX]

[DOI]

CoRR, 2023

Subgraph Densities in $K_r$-Free Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

On $3$-uniform hypergraphs avoiding a cycle of length four.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

2022

The maximum number of paths of length three in a planar graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

The maximum number of induced C 5 's in a planar graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Inverse Turán numbers.

[BibT_eX]

[DOI]

Discret. Math., 2022

2021

The structure of hypergraphs without long Berge cycles.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Connected hypergraphs without long Berge-paths.

[BibT_eX]

[DOI]

Ervin Györi

Nika Salia

Oscar Zamora

Eur. J. Comb., 2021

The maximum number of paths of length four in a planar graph.

[BibT_eX]

[DOI]

Discret. Math., 2021

Generalized Planar Turán Numbers.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

2020

The maximum Wiener index of maximal planar graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2020

2019

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

[BibT_eX]

[DOI]

J. Graph Theory, 2019

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

[BibT_eX]

[DOI]

Nika Salia

Casey Tompkins

Oscar Zamora

Graphs Comb., 2019

The maximum number of Pℓ copies in Pk-free graphs.

[BibT_eX]

[DOI]

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

Ramsey Numbers of Berge-Hypergraphs and Related Structures.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

2018

On the maximum size of connected hypergraphs without a path of given length.

[BibT_eX]

[DOI]

Discret. Math., 2018

2017

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

2013

Numerical comparison of different algorithms for construction of wavelet matrices.

[BibT_eX]

[DOI]

Nika Salia

Alexander Gamkrelidze

Lasha Ephremidze

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

Nika Salia

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...