Nika Salia

activity

20122026

most citedThe Maximum Number of Pentagons in a Planar Graph

7 citations · 28 across the 34 of their papers we have counts for

collaborators

Showing 2017 · math.COShow all

3 papers · 2 filters

math.CO2017★ 3 cited

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

Nika Salia, Casey Tompkins, Oscar Zamora

While investigating odd-cycle free hypergraphs, Győri and Lemons introduced a colored version of the classical theorem of Erdős and Gallai on $P_{k}$ -free graphs. They proved that an…

math.CO2017

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

Ervin Győri, Abhishek Methuku, Nika Salia +2

In this note we asymptotically determine the maximum number of hyperedges possible in an $r$ -uniform, connected $n$ -vertex hypergraph without a Berge path of length $k$ , as $n$ and…

math.CO2017

A note on the maximum number of triangles in a $C_{5}$ -free graph

Beka Ergemlidze, Ervin Győri, Abhishek Methuku +1

We prove that the maximum number of triangles in a $C_{5}$ -free graph on $n$ vertices is at most $\frac{1}{2 2} (1 + o (1)) n^{3/2}$ , improving an estimate of Alon and Shikhelma…

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

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

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

A note on the maximum number of triangles in a $C_{5}$ -free graph