5 citations · 15 across the 16 of their papers we have counts for
7 papers · 1 filter
The Maximum Wiener Index of Maximal Planar Graphs
Debarun Ghosh, Ervin Győri, Addisu Paulos +2
The Wiener index of a connected graph is the sum of the distances between all pairs of vertices in the graph. It was conjectured that the Wiener index of an -vertex maximal plan…
On L(2,1)-labelings of some products of oriented cycles
Lucas Colucci, Ervin Győri
We refine two results of Jiang, Shao and Vesel on the -labeling number of the Cartesian and the strong product of two oriented cycles. For the Cartesian product, we com…
On the anti-Ramsey number of forests
Chunqiu Fang, Ervin Győri, Mei Lu +1
We call a subgraph of an edge-colored graph rainbow subgraph, if all of its edges have different colors. The anti-Ramsey number of a graph in a complete graph , denoted…
Turán numbers of Berge trees
Ervin Győri, Nika Salia, Casey Tompkins +1
A classical conjecture of Erdős and Sós asks to determine the Turán number of a tree. We consider variants of this problem in the settings of hypergraphs and multi-hypergraphs. In…
Edge colorings of graphs without monochromatic stars
Lucas Colucci, Ervin Győri, Abhishek Methuku
In this note, we improve on results of Hoppen, Kohayakawa and Lefmann about the maximum number of edge colorings without monochromatic copies of a star of a fixed size that a graph…
-uniform hypergraphs without a cycle of length five
Beka Ergemlidze, Ervin Győri, Abhishek Methuku
In this paper we show that the maximum number of hyperedges in a -uniform hypergraph on vertices without a (Berge) cycle of length five is less than ,…