E. Györi

activity

20152024

most citedAn Erdős-Gallai type theorem for uniform hypergraphs

39 citations · 93 across the 25 of their papers we have counts for

collaborators

30 papers

math.CO2024

Generalized planar Turán numbers related to short cycles

Ervin Győri, Hilal Hama Karim

Given two graphs $H$ and $F$ , the generalized planar Turán number $ex_{P} (n, H, F)$ is the maximum number of copies of $H$ that an $n$ -vertex $F$ -free planar graph c…

math.CO2024

The anti-Ramsey numbers of cliques in complete multi-partite graphs

Yuyu An, Ervin Gyori, Binlong Li

A subgraph of an edge-colored graph is rainbow if all of its edges have different colors. Let $G$ and $H$ be two graphs. The anti-Ramsey number $\ar(G, H)$ is the maximum number of…

math.CO2023

On graphs without cycles of length 0 modulo 4

Ervin Győri, Binlong Li, Nika Salia +3

Bollobás proved that for every $k$ and $ℓ$ such that $k Z + ℓ$ contains an even number, an $n$ -vertex graph containing no cycle of length $ℓ mod k$ can contain at…

math.CO2023

A note on universal graphs for spanning trees

Ervin Győri, Binlong Li, Nika Salia +1

Chung and Graham considered the problem of minimizing the number of edges in an $n$ -vertex graph containing all $n$ -vertex trees as a subgraph. They showed that such a graph has at…

math.CO2023

Maximum cliques in a graph without disjoint given subgraph

Fangfang Zhang, Yaojun Chen, Ervin Gyori +1

The generalized Turán number $\ex(n,K_s,F)$ denotes the maximum number of copies of $K_{s}$ in an $n$ -vertex $F$ -free graph. Let $k F$ denote $k$ disjoint copies of $F$ . Gerbner, Meth…

math.CO2023★ 1 cited

On the Small Quasi-kernel conjecture

Péter L. Erdős, Ervin Győri, Tamás Róbert Mezei +2

An independent vertex subset $S$ of the directed graph $G$ is a kernel if the set of out-neighbors of $S$ is $V (G) ∖ S$ . An independent vertex subset $Q$ of $G$ is a quasi-k…

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

The maximum number of copies of an even cycle in a planar graph

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

We resolve a conjecture of Cox and Martin by determining asymptotically for every $k \geq 2$ the maximum number of copies of $C_{2 k}$ in an $n$ -vertex planar graph.

math.CO2022★ 2 cited

Extremal results for graphs avoiding a rainbow subgraph

Peter Frankl, Ervin Győri, Zhen He +5

We say that $k$ graphs $G_{1}, G_{2}, \dots, G_{k}$ on a common vertex set of size $n$ contain a rainbow copy of a graph $H$ if their union contains a copy of $H$ with each edge belonging t…

math.CO2021

Generalized outerplanar Turán number of short paths

Ervin Győri, Addisu Paulos, Chuanqi Xiao

Let $H$ be a graph. The generalized outerplanar Turán number of $H$ , denoted by $f_{O P} (n, H)$ , is the maximum number of copies of $H$ in an $n$ -vertex outerplanar graph.…

math.CO2021

Book free $3$ -Uniform Hypergraphs

Debarun Ghosh, Ervin Győri, Judit Nagy-György +3

A $k$ -book in a hypergraph consists of $k$ Berge triangles sharing a common edge. In this paper we prove that the number of the hyperedges in a $k$ -book-free 3-uniform hypergraph o…

math.CO2020

The Maximum Number of Paths of Length Four in a Planar Graph

Debarun Ghosh, Ervin Győri, Ryan R. Martin +4

Let $f (n, H)$ denote the maximum number of copies of $H$ in an $n$ -vertex planar graph. The order of magnitude of $f (n, P_{k})$ , where $P_{k}$ is a path on $k$ vertices, is $n^{{\lfloor{…

math.CO2019

Connected Hypergraphs without long Berge paths

Ervin Győri, Nika Salia, Oscar Zamora

We generalize a result of Balister, Gy{ő}ri, Lehel and Schelp for hypergraphs. We determine the unique extremal structure of an $n$ -vertex, $r$ -uniform, connected, hypergraph with…

math.CO2019★ 3 cited

Half-graphs, other non-stable degree sequences, and the switch Markov chain

Péter L. Erdős, Ervin Győri, Tamás Róbert Mezei +2

One of the simplest methods of generating a random graph with a given degree sequence is provided by the Monte Carlo Markov Chain method using switches. The switch Markov chain con…

math.CO2018★ 6 cited

The maximum number of $P_{ℓ}$ copies in $P_{k}$ -free graphs

Ervin Győri, Nika Salia, Casey Tompkins +1

Generalizing Turán's classical extremal problem, Alon and Shikhelman investigated the problem of maximizing the number of $T$ copies in an $H$ -free graph, for a pair of graphs $T$ …

math.CO2017★ 1 cited

Generalized Turán problems for even cycles

Dániel Gerbner, Ervin Győri, Abhishek Methuku +1

Given a graph $H$ and a set of graphs $F$ , let $e x (n, H, F)$ denote the maximum possible number of copies of $H$ in an $F$ -free graph on $n$ vertices. We i…

math.CO2017★ 10 cited

On the Turán number of some ordered even cycles

Ervin Győri, Dániel Korándi, Abhishek Methuku +3

A classical result of Bondy and Simonovits in extremal graph theory states that if a graph on $n$ vertices contains no cycle of length $2 k$ then it has at most $O (n^{1 + 1/ k})$ edges…

math.CO2017

Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs

Beka Ergemlidze, Ervin Győri, Abhishek Methuku

Let $F$ be a family of $3$ -uniform linear hypergraphs. The linear Turán number of $F$ is the maximum possible number of edges in a $3$ -uniform linear hypergraph…

math.CO2017★ 1 cited

Terminal-Pairability in Complete Bipartite Graphs with Non-Bipartite Demands

Lucas Colucci, Péter L. Erdős, Ervin Győri +1

We investigate the terminal-pairability problem in the case when the base graph is a complete bipartite graph, and the demand graph is a (not necessarily bipartite) multigraph on t…

math.CO2017★ 3 cited

Terminal-Pairability in Complete Bipartite Graphs

Lucas Colucci, Péter L. Erdős, Ervin Győri +1

We investigate the terminal-pairibility problem in the case when the base graph is a complete bipartite graph, and the demand graph is also bipartite with the same color classes. W…

math.CO2016

The Optimal Pebbling Number of Staircase Graphs

Ervin Győri, Gyula Y. Katona, László F. Papp +1

Let G be a graph with a distribution of pebbles on its vertices. A pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The…

math.CO2016

$3$ -uniform hypergraphs and linear cycles

Beka Ergemlidze, Ervin Győri, Abhishek Methuku

Gyárfás, Győri and Simonovits proved that if a $3$ -uniform hypergraph with $n$ vertices has no linear cycles, then its independence number $α \geq \frac{2 n}{5}$ . The hypergraph cons…

math.CO2016

Clique Coverings and Claw-free Graphs

Csilla Bujtás, Akbar Davoodi, Ervin Győri +1

Let $C$ be a clique covering for $E (G)$ and let $v$ be a vertex of $G$ . The valency of vertex $v$ (with respect to $C$ ), denoted by $v a l_{C} (v)$ , is the number of cl…

Generalized planar Turán numbers related to short cycles

The anti-Ramsey numbers of cliques in complete multi-partite graphs

On graphs without cycles of length 0 modulo 4

A note on universal graphs for spanning trees

Maximum cliques in a graph without disjoint given subgraph

On the Small Quasi-kernel conjecture

The maximum Wiener index of a uniform hypergraph

On the rainbow planar Turán number of paths

The maximum number of copies of an even cycle in a planar graph

Extremal results for graphs avoiding a rainbow subgraph

Generalized outerplanar Turán number of short paths

Book free 3-Uniform Hypergraphs

The Maximum Number of Paths of Length Four in a Planar Graph

Connected Hypergraphs without long Berge paths

Half-graphs, other non-stable degree sequences, and the switch Markov chain

The maximum number of Pℓ​ copies in Pk​-free graphs

Generalized Turán problems for even cycles

On the Turán number of some ordered even cycles

Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs

Terminal-Pairability in Complete Bipartite Graphs with Non-Bipartite Demands

Terminal-Pairability in Complete Bipartite Graphs

The Optimal Pebbling Number of Staircase Graphs

3-uniform hypergraphs and linear cycles

Clique Coverings and Claw-free Graphs

Book free $3$ -Uniform Hypergraphs

The maximum number of $P_{ℓ}$ copies in $P_{k}$ -free graphs

$3$ -uniform hypergraphs and linear cycles