Ervin GyHori

activity

20182026

most citedThe planar Turán number of the seven-cycle

2 citations · 2 across the 15 of their papers we have counts for

collaborators

17 papers

math.CO2026

The maximum number of odd cycles in planar graphs forbidding shorter odd cycles

Yichen Wang, Ervin Győri, Zhen He

Given a graph $H$ and a family of graphs $F$ , the generalized planar Turán number $ex_{P} (n, H, F)$ is the maximum number of copies of $H$ in a…

math.CO2026

Induced planar Turán numbers

Ervin Győri, Hilal Hama Karim

The planar Turá number of a graph $F$ is the maximum number of edges an $n$ -vertex $F$ -free planar graph can have. We study the case where $F$ is forbidden as an induced subgraph,…

math.CO2026

The number of induced paths in outerplanar graphs

Yichen Wang, Ervin Győri, Casey Tompkins +1

Let $P_{k}$ denote the path with $k$ vertices, and $ex_{O P} (n, H^{ind}, \emptyset)$ be the maximum number of induced copies of $H$ in an $n$ -vertex outerpla…

math.CO2026

Forbidding matching as trace in uniform hypergraphs

Yichen Wang, Xin Cheng, Ervin Győri +1

We say a hypergraph $H$ contains a hypergraph $G$ as trace if there exists a vertex subset $S \subseteq V (H)$ such that $∣ S ∣ = ∣ V (G) ∣$ and $…

math.CO2026

The Turán number of the Cartesian product of a star and an edge

Xiamiao Zhao, Xin Cheng, Cheng Chi +3

Let $C_{k}$ denote the cycle of length $k$ , $S_{t}$ be a star with $t$ edges. And let $B_{t}$ be the graph consisting of $t$ copies of $C_{4}$ sharing one fixed edge. Equivalently, $B_t=K_…

math.CO2026

Extending partial edge-colorings of bounded size in Cartesian products of graphs

Pál Bärnkopf, Ervin Győri

This paper studies edge-precoloring extensions in Cartesian products of graphs, motivated by a conjecture of Casselgren, Petros, and Fufa. We formulate a general hypothesis stating…