Ervin Győri
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Ervin Győri has a total of 93 co-authors. Here are the top co-authors by number of shared publications:
- Nika Salia
King Fahd University of Petroleum and Minerals
22 shared publications - Abhishek Methuku
Research supported by Department of Mathematics Royal Society University of Illinois at Urbana-Champaign Urbana IL USA
13 shared publications - Casey Tompkins
ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS BUDAPEST HUNGARY
13 shared publications - Chuanqi Xiao
Central European University Budapest
12 shared publications - Addisu Paulos
Central European University, Budapest, Hungary
10 shared publications - Beka Ergemlidze
Department of Mathematics and Statistics University of South Florida 33620 Tampa Florida USA
10 shared publications
Latest Publications
- Open Access
The maximum number of triangles in graphs without the square of a path
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 the classical Turán number $\ex(n,G)$. Let $P_k$ be the path with $k$ vertices. The square of $P_k$, denoted by $P_k^2$, is obtained by joining the pairs of vertices with distance at most two in $P_k$. The Turán number of $P_k^2$, $\ex(n, P_k^2)$, was determined by several researchers. When $k=3$, $P_3^2$ is the triangle and $\ex(n, P_3^2)$ is well-known from Mantel's theorem. When $k=4$, $\ex(n, P_4^2)$ was solved by Dirac in a more general context. When $k=5,6$, the problem was solved by Xiao, Katona, Xiao, and Zamora. For general $k \ge 7$, the problem was solved by Yuan in a more general context. Recently, Mukherjee determined the generalized Turán number $\ex(n, K_3, P_5^2)$. In this paper, we determine the exact value of $\ex(n, K_3, P_6^2)$ and characterize all the extremal graphs for $n \ge 11$.Open AccessThe maximum number of triangles in graphs without the square of a path
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 the classical Turán number $\ex(n,G)$. Let $P_k$ be the path with $k$ vertices. The square of $P_k$, denoted by $P_k^2$, is obtained by joining the pairs of vertices with distance at most two in $P_k$. The Turán number of $P_k^2$, $\ex(n, P_k^2)$, was determined by several researchers. When $k=3$, $P_3^2$ is the triangle and $\ex(n, P_3^2)$ is well-known from Mantel's theorem. When $k=4$, $\ex(n, P_4^2)$ was solved by Dirac in a more general context. When $k=5,6$, the problem was solved by Xiao, Katona, Xiao, and Zamora. For general $k \ge 7$, the problem was solved by Yuan in a more general context. Recently, Mukherjee determined the generalized Turán number $\ex(n, K_3, P_5^2)$. In this paper, we determine the exact value of $\ex(n, K_3, P_6^2)$ and characterize all the extremal graphs for $n \ge 11$. - 25 July 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 349 (2)
The anti-Ramsey numbers of cliques in complete multi-partite graphs
- 25 July 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 349 (2)
The anti-Ramsey numbers of cliques in complete multi-partite graphs
- 16 September 2024
- Published by Wiley in Journal of Graph Theory
- Vol. 108 (2) , 229-256
The maximum number of pentagons in a planar graph
In 1979, Hakimi and Schmeichel considered the problem of maximizing the number of cycles of a given length in an ‐vertex planar graph. They precisely determined the maximum number of triangles and four‐cycles and presented a conjecture for the maximum number of pentagons. In this work, we confirm their conjecture. Even more, we characterize the ‐vertex, planar graphs with the maximum number of pentagons.
- 16 September 2024
- Published by Wiley in Journal of Graph Theory
- Vol. 108 (2) , 229-256
The maximum number of pentagons in a planar graph
In 1979, Hakimi and Schmeichel considered the problem of maximizing the number of cycles of a given length in an ‐vertex planar graph. They precisely determined the maximum number of triangles and four‐cycles and presented a conjecture for the maximum number of pentagons. In this work, we confirm their conjecture. Even more, we characterize the ‐vertex, planar graphs with the maximum number of pentagons.
- Open Access
- 3 September 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (1)
Covering the edges of a graph with triangles
- 3 September 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (1)
Open AccessCovering the edges of a graph with triangles
- Open Access
- 18 August 2024
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 40 (5) , 1-12
The Planar Turán Number of $\{K_4,C_5\}$ and $\{K_4,C_6\}$Let $$\mathcal {H}$$ be a set of graphs. The planar Turán number, $$ex_\mathcal {P}(n,\mathcal {H})$$ , is the maximum number of edges in an n-vertex planar graph which does not contain any member of $$\mathcal {H}$$ as a subgraph. When $$\mathcal {H}=\{H\}$$ has only one element, we usually write $$ex_\mathcal {P}(n,H)$$ instead. The study of extremal planar graphs was initiated by Dowden (J Graph Theory 83(3):213–230, 2016). He obtained sharp upper bounds for both $$ex_\mathcal {P}(n,C_5)$$ and $$ex_\mathcal {P}(n,K_4)$$ . Later on, sharp upper bounds were proved for $$ex_\mathcal {P}(n,C_6)$$ and $$ex_\mathcal {P}(n,C_7)$$ . In this paper, we show that $$ex_\mathcal {P}(n,\{K_4,C_5\})\le {15\over 7}(n-2)$$ and $$ex_\mathcal {P}(n,\{K_4,C_6\})\le {7\over 3}(n-2)$$ . We also give constructions which show the bounds are sharp for infinitely many n.- 18 August 2024
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 40 (5) , 1-12
Open AccessThe Planar Turán Number of $\{K_4,C_5\}$ and $\{K_4,C_6\}$Let $$\mathcal {H}$$ be a set of graphs. The planar Turán number, $$ex_\mathcal {P}(n,\mathcal {H})$$ , is the maximum number of edges in an n-vertex planar graph which does not contain any member of $$\mathcal {H}$$ as a subgraph. When $$\mathcal {H}=\{H\}$$ has only one element, we usually write $$ex_\mathcal {P}(n,H)$$ instead. The study of extremal planar graphs was initiated by Dowden (J Graph Theory 83(3):213–230, 2016). He obtained sharp upper bounds for both $$ex_\mathcal {P}(n,C_5)$$ and $$ex_\mathcal {P}(n,K_4)$$ . Later on, sharp upper bounds were proved for $$ex_\mathcal {P}(n,C_6)$$ and $$ex_\mathcal {P}(n,C_7)$$ . In this paper, we show that $$ex_\mathcal {P}(n,\{K_4,C_5\})\le {15\over 7}(n-2)$$ and $$ex_\mathcal {P}(n,\{K_4,C_6\})\le {7\over 3}(n-2)$$ . We also give constructions which show the bounds are sharp for infinitely many n. - 24 July 2024
- Published by Akademiai Kiado Zrt. in Studia Scientiarum Mathematicarum Hungarica
- Vol. 61 (2) , 89-115
Planar Turán Number of the Θ6
Let F be a nonempty family of graphs. A graph 𝐺 is called F -free if it contains no graph from F as a subgraph. For a positive integer 𝑛, the planar Turán number of F, denoted by exp (𝑛, F), is the maximum number of edges in an 𝑛-vertex F -free planar graph.Let Θ
- 24 July 2024
- Published by Akademiai Kiado Zrt. in Studia Scientiarum Mathematicarum Hungarica
- Vol. 61 (2) , 89-115
Planar Turán Number of the Θ6
Let F be a nonempty family of graphs. A graph 𝐺 is called F -free if it contains no graph from F as a subgraph. For a positive integer 𝑛, the planar Turán number of F, denoted by exp (𝑛, F), is the maximum number of edges in an 𝑛-vertex F -free planar graph.Let Θ
- Open Access
- 22 February 2024
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 167, 15-22
The maximum number of copies of an even cycle in a planar graph
- 22 February 2024
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 167, 15-22
Open AccessThe maximum number of copies of an even cycle in a planar graph
- Open Access
- 24 January 2024
- Published by Springer Nature in Annals of Combinatorics
- Vol. 28 (4) , 1119-1125
The Maximum Number of Cliques in Graphs with Bounded Odd Circumference
In this work, we give the sharp upper bound for the number of cliques in graphs with bounded odd circumferences. This generalized Turán-type result is an extension of the celebrated Erdős and Gallai theorem and a strengthening of Luo’s recent result. The same bound for graphs with bounded even circumferences is a trivial application of the theorem of Li and Ning.
- 24 January 2024
- Published by Springer Nature in Annals of Combinatorics
- Vol. 28 (4) , 1119-1125
Open AccessThe Maximum Number of Cliques in Graphs with Bounded Odd Circumference
In this work, we give the sharp upper bound for the number of cliques in graphs with bounded odd circumferences. This generalized Turán-type result is an extension of the celebrated Erdős and Gallai theorem and a strengthening of Luo’s recent result. The same bound for graphs with bounded even circumferences is a trivial application of the theorem of Li and Ning.
- Open Access
The anti-Ramsey numbers of cliques in complete multi-partite graphs
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 colors of an edge-coloring of $G$ that does not contain a rainbow copy of $H$. In this paper, we study the anti-Ramsey numbers of $K_k$ in complete multi-partite graphs. We determine the values of the anti-Ramsey numbers of $K_k$ in complete $k$-partite graphs and in balanced complete $r$-partite graphs for $r\geq k$.Open AccessThe anti-Ramsey numbers of cliques in complete multi-partite graphs
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 colors of an edge-coloring of $G$ that does not contain a rainbow copy of $H$. In this paper, we study the anti-Ramsey numbers of $K_k$ in complete multi-partite graphs. We determine the values of the anti-Ramsey numbers of $K_k$ in complete $k$-partite graphs and in balanced complete $r$-partite graphs for $r\geq k$.