Ervin GyHori

activity

20162026

most citedThe maximum number of triangles in

F_{k}

-free graphs

3 citations · 9 across the 21 of their papers we have counts for

collaborators

21 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…

math.CO2026

Forbidding edge-critical graphs as trace in uniform hypergraphs

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

We say a hypergraph $H$ contains a graph $G$ as trace if there exists a vertex subset $S \subseteq V (H)$ such that $∣ S ∣ = V (G)$ and $\{e \cap S \mid e \in E(\ma…

math.CO2026

The maximum number of triangles in graphs without the square of a path

Yichen Wang, Ervin Győri

The generalized Turán number for $H$ of $G$ , denoted by $\ex(n,H,G)$, is the maximum number of copies of $H$ in an $n$ -vertex $G$ -free graph. When $H$ is an edge, $\ex(n,H,G)$ is t…

math.CO2025

Sets avoiding a rainbow solution to the generalized Schur equation

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

A classical result in combinatorial number theory states that the largest subset of $[n]$ avoiding a solution to the equation $x + y = z$ is of size $⌈ n /2 ⌉$ . For all intege…

math.CO2024

Connected Turán numbers for Berge paths in hypergraphs

Lin-Peng Zhang, Hajo Broersma, Ervin Győri +2

Let $F$ be a family of $r$ -uniform hypergraphs. Denote by $\ex^{\mathrm{conn}}_r(n,\mathcal{F})$ the maximum number of hyperedges in an $n$ -vertex connected $r$ -uniform h…

math.CO2024

The Planar Turán Number of $Θ_{6}$ -graphs

David Guan, Ervin Győri, Diep Luong-Le +2

There are two particular $Θ_{6}$ -graphs - the 6-cycle graphs with a diagonal. We find the planar Turán number of each of them, i.e. the maximum number of edges in a planar graph $G$ …

math.CO2023

Outerplanar Turán number of a cycle

Ervin Győri, Guilherme Zeus Dantas e Moura, Runtian Zhou

A graph is outerplanar if it has a planar drawing for which all vertices belong to the outer face of the drawing. Let $H$ be a graph. The outerplanar Turán number of $H$ , denoted b…

math.CO2023

The planar Turán number of ${K_{4}, C_{5}}$ and ${K_{4}, C_{6}}$

Ervin Győri, Alan Li, Runtian Zhou

Let $H$ be a set of graphs. The planar Turán number, $e x_{P} (n, H)$ , is the maximum number of edges in an $n$ -vertex planar graph which does not contain…

math.CO2023★ 2 cited

The planar Turán number of the seven-cycle

Ervin Győri, Alan Li, Runtian Zhou

The planar Turán number, $e x_{P} (n, H)$ , is the maximum number of edges in an $n$ -vertex planar graph which does not contain $H$ as a subgraph. The topic of extremal planar…

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★ 3 cited

The maximum number of triangles in $F_{k}$ -free graphs

Xiutao Zhu, Yaojun Chen, Dániel Gerbner +2

The generalized Turán number $e x (n, K_{s}, H)$ is the maximum number of complete graph $K_{s}$ in an $H$ -free graph on $n$ vertices. Let $F_{k}$ be the friendship graph consisting of $k$ t…

math.CO2021★ 3 cited

Planar Turán Number of Double Stars

Debarun Ghosh, Ervin Győri, Addisu Paulos +1

Given a graph $F$ , the planar Turán number of $F$ , denoted $ex_{P} (n, F)$ , is the maximum number of edges in an $n$ -vertex $F$ -free planar graph. Such an extremal…

math.CO2020

Generalized Planar Turán Numbers

Ervin Győri, Addisu Paulos, Nika Salia +2

In a generalized Turán problem, we are given graphs $H$ and $F$ and seek to maximize the number of copies of $H$ in an $F$ -free graph of order $n$ . We consider generalized Turán pr…

math.CO2019

Minimal colorings for properly colored subgraphs in complete graphs

Chunqiu Fang, Ervin Győri, Jimeng Xiao

Let $p r (K_{n}, G)$ be the maximum number of colors in an edge-coloring of $K_{n}$ with no properly colored copy of $G$ . In this paper, we show that $pr(K_{n}, G)-ex(n, \mathcal{G'}…

math.CO2018

On the Rainbow Turán number of paths

Beka Ergemlidze, Ervin Győri, Abhishek Methuku

Let $F$ be a fixed graph. The rainbow Turán number of $F$ is defined as the maximum number of edges in a graph on $n$ vertices that has a proper edge-coloring with no rainbow copy…

math.CO2016

On the Linear Cycle Cover Conjecture of Gyárfás and Sárközy

Beka Ergemlidze, Ervin Győri, Abhishek Methuku

A linear cycle in a hypergraph $H$ is a cyclic sequence of hyperedges such that two consecutive hyperedges intersect in exactly one element and two nonconsecutive hyperedges are di…

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

Induced planar Turán numbers

The number of induced paths in outerplanar graphs

Forbidding matching as trace in uniform hypergraphs

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

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

Forbidding edge-critical graphs as trace in uniform hypergraphs

The maximum number of triangles in graphs without the square of a path

Sets avoiding a rainbow solution to the generalized Schur equation

Connected Turán numbers for Berge paths in hypergraphs

The Planar Turán Number of Θ6​-graphs

Outerplanar Turán number of a cycle

The planar Turán number of {K4​,C5​} and {K4​,C6​}

The planar Turán number of the seven-cycle

Extremal planar graphs with no cycles of particular lengths

The maximum number of triangles in Fk​-free graphs

Planar Turán Number of Double Stars

Generalized Planar Turán Numbers

Minimal colorings for properly colored subgraphs in complete graphs

On the Rainbow Turán number of paths

On the Linear Cycle Cover Conjecture of Gyárfás and Sárközy

The Planar Turán Number of $Θ_{6}$ -graphs

The planar Turán number of ${K_{4}, C_{5}}$ and ${K_{4}, C_{6}}$

The maximum number of triangles in $F_{k}$ -free graphs