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

3 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

The exact linear Turán number of the Sail

Beka Ergemlidze, Ervin Győri, Abhishek Methuku

A hypergraph is linear if any two of its edges intersect in at most one vertex. The Sail (or $3$ -fan) $F^{3}$ is the $3$ -uniform linear hypergraph consisting of $3$ edges $f_1, f_2,…

math.CO2020★ 1 cited

A note on maximum size of Berge- $C_{4}$ -free hypergraphs

Beka Ergemlidze

In this paper, we consider maximum possible value for the sum of cardinalities of hyperedges of a hypergraph without a Berge $4$ -cycle. We significantly improve the previous upper…

On 3-uniform hypergraphs avoiding a cycle of length four

The exact linear Turán number of the Sail

A note on maximum size of Berge-C4​-free hypergraphs

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

A note on maximum size of Berge- $C_{4}$ -free hypergraphs