Nika Salia

activity

20172026

most citedHow connectivity affects the extremal number of trees

2 citations · 10 across the 25 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

math.CO2017

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