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

2 papers · 1 filter

math.CO2019

New bounds for a hypergraph Bipartite Turán problem

Beka Ergemlidze, Tao Jiang, Abhishek Methuku

Let $t$ be an integer such that $t \geq 2$ . Let $K_{2, t}^{(3)}$ denote the triple system consisting of the $2 t$ triples ${a, x_{i}, y_{i}}$ , ${b, x_{i}, y_{i}}$ for $1 \leq i \leq t$ , where t…

math.CO2019

$3$ -uniform hypergraphs without a cycle of length five

Beka Ergemlidze, Ervin Győri, Abhishek Methuku

In this paper we show that the maximum number of hyperedges in a $3$ -uniform hypergraph on $n$ vertices without a (Berge) cycle of length five is less than $(0.254 + o (1)) n^{3/2}$ ,…

New bounds for a hypergraph Bipartite Turán problem

3-uniform hypergraphs without a cycle of length five

$3$ -uniform hypergraphs without a cycle of length five