5 citations · 15 across the 16 of their papers we have counts for
23 papers
Linear three-uniform hypergraphs with no Berge path of given length
Ervin Győri, Nika Salia
Extensions of Erdős-Gallai Theorem for general hypergraphs are well studied. In this work, we prove the extension of Erdős-Gallai Theorem for linear hypergraphs. In particular, we…
Edges not covered by monochromatic bipartite graphs
Xiutao Zhu, Ervin Győri, Zhen He +4
Let denote the maximum number of edges not contained in any monochromatic copy of~ in a -coloring of the edges of , and let denote the Turán number…
Generalized Turan number for the edge blow-up graph
Zequn Lv, Ervin Győri, Zhen He +4
Let be a graph and be an integer. The edge blow-up of is the graph obtained from replacing each edge in by a copy of where the new vertices of the cliqu…
Subgraph densities in -free graphs
Andrzej Grzesik, Ervin Győri, Nika Salia +1
In this paper we disprove a conjecture of Lidický and Murphy about the number of copies of a given graph in a -free graph and give an alternative general conjecture. We also p…
The Turán Number of the Triangular Pyramid of -Layers
Debarun Ghosh, Ervin Győri, Addisu Paulos +2
The Turán number of a graph , denoted by , is the maximum number of edges in an -vertex graph that does not have as a subgraph. Let be the triangu…
Turán numbers and anti-Ramsey numbers for short cycles in complete -partite graphs
Chunqiu Fang, Ervin Győri, Chuanqi Xiao +1
We call a -cycle in multipartite, denoted by , if it contains at least one vertex in each part of . The…