Beka Ergemlidze

According to our database, Beka Ergemlidze authored at least 16 papers between 2017 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Minimizing the number of complete bipartite graphs in a K_s-saturated graph.

Beka Ergemlidze, Abhishek Methuku, Michael Tait, Craig Timmons

Discuss. Math. Graph Theory, 2023

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

Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins

Electron. J. Comb., 2023

2022

Triangles in C 5 -free graphs and hypergraphs of girth six.

Beka Ergemlidze, Abhishek Methuku

J. Graph Theory, 2022

Transversal Ck-factors in subgraphs of the balanced blow-up of Ck.

Beka Ergemlidze, Theodore Molla

Comb. Probab. Comput., 2022

2021

A note on the maximum size of Berge-C4-free hypergraphs.

Beka Ergemlidze

Discret. Math., 2021

The Exact Linear Turán Number of the Sail.

Beka Ergemlidze, Ervin Györi, Abhishek Methuku

Electron. J. Comb., 2021

2020

New bounds for a hypergraph bipartite Turán problem.

Beka Ergemlidze, Tao Jiang, Abhishek Methuku

J. Comb. Theory A, 2020

Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2.

Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins, Oscar Zamora

Comb. Probab. Comput., 2020

3-Uniform Hypergraphs without a Cycle of Length Five.

Beka Ergemlidze, Ervin Györi, Abhishek Methuku

Electron. J. Comb., 2020

2019

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

Beka Ergemlidze, Abhishek Methuku, Nika Salia, Ervin Györi

J. Graph Theory, 2019

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

Beka Ergemlidze, Ervin Györi, Abhishek Methuku

J. Comb. Theory A, 2019

Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle.

Beka Ergemlidze, Ervin Györi, Abhishek Methuku

Comb. Probab. Comput., 2019

On the Rainbow Turán number of paths.

Beka Ergemlidze, Ervin Györi, Abhishek Methuku

Electron. J. Comb., 2019

2018

A Note on the Linear Cycle Cover Conjecture of Gyárfás and Sárközy.

Beka Ergemlidze, Ervin Györi, Abhishek Methuku

Electron. J. Comb., 2018

2017

A note on the maximum number of triangles in a C₅-free graph.

Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia

Electron. Notes Discret. Math., 2017

3-uniform hypergraphs and linear cycles.

Beka Ergemlidze, Ervin Györi, Abhishek Methuku

Electron. Notes Discret. Math., 2017