  |
Items where Author is "Ergemlidze, Beka"
Group by: Item Type | No Grouping Number of items: 10. Ergemlidze, Beka and Győri, Ervin and Methuku, Abhishek and Salia, Nika and Tompkins, Casey (2023) On 3-uniform hypergraphs avoiding a cycle of length four. ELECTRONIC JOURNAL OF COMBINATORICS, 30 (4). ISSN 1097-1440 Ergemlidze, Beka and Győri, Ervin and Methuku, Abhishek and Salia, Nika and Tompkins, Casey and Zamora, Oscar (2020) Avoiding long Berge cycles, the missing cases k=r+1 and k=r+2. COMBINATORICS PROBABILITY & COMPUTING, 29 (3). pp. 423-435. ISSN 0963-5483 (print); 1469-2163 (online) Ergemlidze, Beka and Győri, Ervin and Methuku, Abhishek (2019) Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES A, 163. pp. 163-181. ISSN 0097-3165 Ergemlidze, Beka and Győri, Ervin and Methuku, Abhishek (2019) On the Rainbow Turan number of paths. ELECTRONIC JOURNAL OF COMBINATORICS, 26 (1). ISSN 1097-1440 Ergemlidze, Beka and Győri, Ervin and Methuku, Abhishek (2019) Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle. COMBINATORICS PROBABILITY AND COMPUTING, 28 (2). pp. 241-252. ISSN 0963-5483 Ergemlidze, Beka and Methuku, Abhishek and Salia, Nika and Győri, Ervin (2019) A note on the maximum number of triangles in a C5-free graph. JOURNAL OF GRAPH THEORY, 90 (3). pp. 227-230. ISSN 0364-9024 Ergemlidze, Beka and Győri, Ervin and Methuku, Abhishek (2018) 3-uniform hypergraphs and linear cycles∗. SIAM JOURNAL ON DISCRETE MATHEMATICS, 32 (2). pp. 933-950. ISSN 0895-4801 Ergemlidze, Beka and Győri, Ervin and Methuku, Abhishek (2018) A note on the linear cycle cover conjecture of Gyárfás and Sárközy. ELECTRONIC JOURNAL OF COMBINATORICS, 25 (2). ISSN 1097-1440 Ergemlidze, Beka and Győri, Ervin and Methuku, Abhishek (2017) 3-uniform hypergraphs and linear cycles. ELECTRONIC NOTES IN DISCRETE MATHEMATICS, 61. pp. 391-394. ISSN 1571-0653 Ergemlidze, Beka and Győri, Ervin and Methuku, Abhishek and Salia, Nika (2017) A note on the maximum number of triangles in a C5-free graph. ELECTRONIC NOTES IN DISCRETE MATHEMATICS, 61. pp. 395-398. ISSN 1571-0653 |
