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 2020Show all

6 papers · 1 filter

math.CO2020★ 2 cited

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

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

In this note we show that the maximum number of edges in a $3$ -uniform hypergraph without a Berge cycle of length four is at most $(1 + o (1)) \frac{n ^{3/2}}{10}$ . This improves…

math.CO2020

Stability of extremal connected hypergraphs avoiding Berge-paths

Dániel Gerbner, Dániel T. Nagy, Balázs Patkós +2

A Berge-path of length $k$ in a hypergraph $H$ is a sequence $v_{1}, e_{1}, v_{2}, e_{2}, \dots, v_{k}, e_{k}, v_{k + 1}$ of distinct vertices and hyperedges with $v_{i}, v_{i + 1} \in e_{i}$ , f…

math.CO2020

Inverse Turán numbers

Ervin Győri, Nika Salia, Casey Tompkins +1

For given graphs $G$ and $F$ , the Turán number $e x (G, F)$ is defined to be the maximum number of edges in an $F$ -free subgraph of $G$ . Foucaud, Krivelevich and Perarnau and later in…

math.CO2020

The Maximum Number of Paths of Length Four in a Planar Graph

Debarun Ghosh, Ervin Győri, Ryan R. Martin +4

Let $f (n, H)$ denote the maximum number of copies of $H$ in an $n$ -vertex planar graph. The order of magnitude of $f (n, P_{k})$ , where $P_{k}$ is a path on $k$ vertices, is $n^{{\lfloor{…

math.CO2020

The maximum number of induced $C_{5}$ 's in a planar graph

Debarun Ghosh, Ervin Győri, Oliver Janzer +3

Finding the maximum number of induced cycles of length $k$ in a graph on $n$ vertices has been one of the most intriguing open problems of Extremal Graph Theory. Recently Balogh, H…

math.CO2020

Generalized Planar Turán Numbers

Ervin Győri, Addisu Paulos, Nika Salia +2

In a generalized Turán problem, we are given graphs $H$ and $F$ and seek to maximize the number of copies of $H$ in an $F$ -free graph of order $n$ . We consider generalized Turán pr…

On 3-uniform hypergraphs avoiding a cycle of length four

Stability of extremal connected hypergraphs avoiding Berge-paths

Inverse Turán numbers

The Maximum Number of Paths of Length Four in a Planar Graph

The maximum number of induced C5​'s in a planar graph

Generalized Planar Turán Numbers

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

The maximum number of induced $C_{5}$ 's in a planar graph