Beka Ergemlidze

activity

20162021

most citedTurán number of an induced complete bipartite graph plus an odd cycle

5 citations · 11 across the 11 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

math.CO2018

Triangles in $C_{5}$ -free graphs and Hypergraphs of Girth Six

Beka Ergemlidze, Abhishek Methuku

We introduce a new approach and prove that the maximum number of triangles in a $C_{5}$ -free graph on $n$ vertices is at most $(1 + o (1)) \frac{1}{3 2} n^{3/2} .$ We also show…

math.CO2018

On the Rainbow Turán number of paths

Beka Ergemlidze, Ervin Győri, Abhishek Methuku

Let $F$ be a fixed graph. The rainbow Turán number of $F$ is defined as the maximum number of edges in a graph on $n$ vertices that has a proper edge-coloring with no rainbow copy…

Triangles in C5​-free graphs and Hypergraphs of Girth Six

On the Rainbow Turán number of paths

Triangles in $C_{5}$ -free graphs and Hypergraphs of Girth Six