Beka Ergemlidze

From MaRDI portal
(Redirected from Person:668068)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
On \(3\)-uniform hypergraphs avoiding a cycle of length four
The Electronic Journal of Combinatorics
2024-02-16Paper
Triangles in C5‐free graphs and hypergraphs of girth six
Journal of Graph Theory
2023-10-04Paper
Transversal Ck-factors in subgraphs of the balanced blow-up of Ck
Combinatorics, Probability and Computing
2023-03-31Paper
The exact linear Turán number of the sail
The Electronic Journal of Combinatorics
2022-04-04Paper
Avoiding long Berge cycles: the missing cases \(k=r+1\) and \(k=r+2\)
Combinatorics, Probability and Computing
2021-06-15Paper
A note on the maximum size of Berge-\( C_4\)-free hypergraphs
Discrete Mathematics
2021-03-25Paper
Transversal $C_k$-factors in subgraphs of the balanced blow-up of $C_k$
(available as arXiv preprint)
2021-03-17Paper
Minimizing the number of complete bipartite graphs in a $K_s$-saturated graph2021-01-02Paper
New bounds for a hypergraph bipartite Turán problem
Journal of Combinatorial Theory. Series A
2020-09-07Paper
3-uniform hypergraphs without a cycle of length five
The Electronic Journal of Combinatorics
2020-05-20Paper
Turán number of an induced complete bipartite graph plus an odd cycle
Combinatorics, Probability and Computing
2020-03-11Paper
A note on the maximum number of triangles in a C5‐free graph
Journal of Graph Theory
2019-03-28Paper
On the rainbow Turán number of paths
The Electronic Journal of Combinatorics
2019-03-05Paper
On the rainbow Turán number of paths
The Electronic Journal of Combinatorics
2019-03-05Paper
Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
Journal of Combinatorial Theory. Series A
2019-01-25Paper
Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
Journal of Combinatorial Theory. Series A
2019-01-25Paper
A note on the linear cycle cover conjecture of Gyárfás and Sárközy
The Electronic Journal of Combinatorics
2018-05-25Paper
A note on the linear cycle cover conjecture of Gyárfás and Sárközy
The Electronic Journal of Combinatorics
2018-05-25Paper
3-uniform hypergraphs and linear cycles
SIAM Journal on Discrete Mathematics
2018-04-27Paper
3-uniform hypergraphs and linear cycles2018-01-18Paper
3-uniform hypergraphs and linear cycles
(available as arXiv preprint)
2018-01-18Paper
A note on the maximum number of triangles in a \(C_5\)-free graph
(available as arXiv preprint)
2018-01-18Paper


Research outcomes over time


This page was built for person: Beka Ergemlidze