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

3 papers · 1 filter

math.CO2017★ 5 cited

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

Beka Ergemlidze, Ervin Győri, Abhishek Methuku

Let $k \geq 2$ be an integer. We show that if $s = 2$ and $t \geq 2$ , or $s = t = 3$ , then the maximum possible number of edges in a $C_{2 k + 1}$ -free graph containing no induced copy…

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…

math.CO2017

Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs

Beka Ergemlidze, Ervin Győri, Abhishek Methuku

Let $F$ be a family of $3$ -uniform linear hypergraphs. The linear Turán number of $F$ is the maximum possible number of edges in a $3$ -uniform linear hypergraph…

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

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

Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs

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