5 citations · 15 across the 16 of their papers we have counts for
6 papers · 1 filter
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…
Set-Sequential Labelings of Odd Trees
Emily Eckels, Ervin Gyori, Junsheng Liu +1
A tree on vertices is called set-sequential if the elements in can be labeled with distinct nonzero -dimensional -vectors such that the vector…
On -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 -uniform hypergraph without a Berge cycle of length four is at most . This improves…
Inverse Turán numbers
Ervin Győri, Nika Salia, Casey Tompkins +1
For given graphs and , the Turán number is defined to be the maximum number of edges in an -free subgraph of . Foucaud, Krivelevich and Perarnau and later in…
Planar Turán number of the 6-cycle
Debarun Ghosh, Ervin Győri, Ryan R. Martin +2
Let denote the maximum number of copies of in an -vertex planar graph which does not contain as a subgraph. When , ${\rm ex}_{\mat…
Wiener Index of Quadrangulation Graphs
Ervin Győri, Addisu Paulos, Chuanqi Xiao
The Wiener index of a graph , denoted , is the sum of the distances between all pairs of vertices in . É. Czabarka, et al. conjectured that for an -vertex, …