7 citations · 15 across the 13 of their papers we have counts for
16 papers
On the Halin Turán number of short cycles
Addisu Paulos
A Halin graph is a graph constructed by embedding a tree with no vertex of degree two in the plane and then adding a cycle to join the tree's leaves. The Halin Turán number of a gr…
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- if it contains as a subgraph and every edge of is a distinct color. The problem of maximizing edges among -vertex…
Planar Turán Number of Double Stars
Debarun Ghosh, Ervin Győri, Addisu Paulos +1
Given a graph , the planar Turán number of , denoted , is the maximum number of edges in an -vertex -free planar graph. Such an extremal…
Generalized outerplanar Turán number of short paths
Ervin Győri, Addisu Paulos, Chuanqi Xiao
Let be a graph. The generalized outerplanar Turán number of , denoted by , is the maximum number of copies of in an -vertex outerplanar graph.…
Book free -Uniform Hypergraphs
Debarun Ghosh, Ervin Győri, Judit Nagy-György +3
A -book in a hypergraph consists of Berge triangles sharing a common edge. In this paper we prove that the number of the hyperedges in a -book-free 3-uniform hypergraph o…
The Turán Number of the Triangular Pyramid of -Layers
Debarun Ghosh, Ervin Győri, Addisu Paulos +2
The Turán number of a graph , denoted by , is the maximum number of edges in an -vertex graph that does not have as a subgraph. Let be the triangu…
Planar Turán Number of the
Debarun Ghosh, Ervin Győri, Addisu Paulos +2
Let be a nonempty family of graphs. A graph is called -\textit{free} if it contains no graph from as a subgraph. For a positive integer…
The Minimum Number of -Cycles in a Maximal Planar Graph with Small Number of Vertices
Ervin Győri, Addisu Paulos, Oscar Zamora
Hakimi and Schmeichel determined a sharp lower bound for the number of cycles of length 4 in a maximal planar graph with vertices, . It has been shown that the bound i…
Planar Turán number of the 6-cycle
Debarun Ghosh, Ervin Győri, Ryan R. Martin +2
Let denote the maximum number of copies of in an -vertex planar graph which does not contain as a subgraph. When , ${\rm ex}_{\mat…
The Maximum Number of Paths of Length Four in a Planar Graph
Debarun Ghosh, Ervin Győri, Ryan R. Martin +4
Let denote the maximum number of copies of in an -vertex planar graph. The order of magnitude of , where is a path on vertices, is $n^{{\lfloor{…
The maximum number of induced 's in a planar graph
Debarun Ghosh, Ervin Győri, Oliver Janzer +3
Finding the maximum number of induced cycles of length in a graph on vertices has been one of the most intriguing open problems of Extremal Graph Theory. Recently Balogh, H…
Generalized Planar Turán Numbers
Ervin Győri, Addisu Paulos, Nika Salia +2
In a generalized Turán problem, we are given graphs and and seek to maximize the number of copies of in an -free graph of order . We consider generalized Turán pr…
Wiener Index of Quadrangulation Graphs
Ervin Győri, Addisu Paulos, Chuanqi Xiao
The Wiener index of a graph , denoted , is the sum of the distances between all pairs of vertices in . É. Czabarka, et al. conjectured that for an -vertex, …
The Maximum Wiener Index of Maximal Planar Graphs
Debarun Ghosh, Ervin Győri, Addisu Paulos +2
The Wiener index of a connected graph is the sum of the distances between all pairs of vertices in the graph. It was conjectured that the Wiener index of an -vertex maximal plan…
The Maximum Number of Paths of Length Three in a Planar Graph
Andrzej Grzesik, Ervin Győri, Addisu Paulos +3
Let denote the maximum number of copies of possible in an -vertex planar graph. The function has been determined when is a cycle of length or b…
The Maximum Number of Pentagons in a Planar Graph
Ervin Győri, Addisu Paulos, Nika Salia +2
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 numb…