Ervin Győri

activity

20152023

most citedNote on Terminal-Pairability in Complete Grid Graphs

11 citations · 14 across the 10 of their papers we have counts for

collaborators

10 papers

math.CO2023

The maximum Wiener index of a uniform hypergraph

Stijn Cambie, Ervin Győri, Nika Salia +2

The Wiener index of a (hyper)graph is calculated by summing up the distances between all pairs of vertices. We determine the maximum possible Wiener index of a connected $n$ -vertex…

math.CO2023

On the rainbow planar Turán number of paths

Ervin Győri, Ryan R. Martin, Addisu Paulos +2

An edge-colored graph is said to contain a rainbow- $F$ if it contains $F$ as a subgraph and every edge of $F$ is a distinct color. The problem of maximizing edges among $n$ -vertex…

math.CO2022★ 1 cited

Extremal planar graphs with no cycles of particular lengths

Ervin Győri, Xianzhi Wang, Zeyu Zheng

In this paper we estimate the planar Turán number $ex_{P} (n, H)$ of some graphs $H$ , i.e., the maximum number of edges in a planar graph $G$ of $n$ vertices not con…

math.CO2022

Exact results for generalized extremal problems forbidding an even cycle

Ervin Győri, Zhen He, Zequn Lv +4

We determine the maximum number of copies of $K_{s, s}$ in a $C_{2 s + 2}$ -free $n$ -vertex graph for all integers $s \geq 2$ and sufficiently large $n$ . Moreover, for $s \in {2, 3}$ and…

math.CO2022★ 1 cited

Stability version of Dirac's theorem and its applications for generalized Turán problems

Xiutao Zhu, Ervin Győri, Zhen He +3

In 1952, Dirac proved that every $2$ -connected $n$ -vertex graph with the minimum degree $k + 1$ contains a cycle of length at least $min {n, 2 (k + 1)}$ . Here we obtain a stability ve…

math.CO2020★ 1 cited

The anti-Ramsey number of $C_{3}$ and $C_{4}$ in the complete $r$ -partite graphs

Chunqiu Fang, Ervin Győri, Binlong Li +1

A subgraph of an edge-colored graph is rainbow, if all of its edges have different colors. For a graph $G$ and a family $H$ of graphs, the anti-Ramsey number $ar(G, \math…