Addisu Paulos

activity

20192023

most citedThe Maximum Number of Pentagons in a Planar Graph

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

collaborators

Showing 2020Show all

7 papers · 1 filter

math.CO2020

Planar Turán Number of the $Θ_{6}$

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

Let $F$ be a nonempty family of graphs. A graph $G$ is called $F$ -\textit{free} if it contains no graph from $F$ as a subgraph. For a positive integer…

math.CO2020★ 1 cited

The Minimum Number of $4$ -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 $n$ vertices, $n \geq 5$ . It has been shown that the bound i…

math.CO2020★ 1 cited

Planar Turán number of the 6-cycle

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

Let $ex_{P} (n, T, H)$ denote the maximum number of copies of $T$ in an $n$ -vertex planar graph which does not contain $H$ as a subgraph. When $T = K_{2}$ , ${\rm ex}_{\mat…

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.CO2020

The maximum number of induced $C_{5}$ 's in a planar graph

Debarun Ghosh, Ervin Győri, Oliver Janzer +3

Finding the maximum number of induced cycles of length $k$ in a graph on $n$ vertices has been one of the most intriguing open problems of Extremal Graph Theory. Recently Balogh, H…

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.CO2020★ 1 cited

Wiener Index of Quadrangulation Graphs

Ervin Győri, Addisu Paulos, Chuanqi Xiao

The Wiener index of a graph $G$ , denoted $W (G)$ , is the sum of the distances between all pairs of vertices in $G$ . É. Czabarka, et al. conjectured that for an $n$ -vertex, $n \geq 4$ …

Planar Turán Number of the Θ6​

The Minimum Number of 4-Cycles in a Maximal Planar Graph with Small Number of Vertices

Planar Turán number of the 6-cycle

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

The maximum number of induced C5​'s in a planar graph

Generalized Planar Turán Numbers

Wiener Index of Quadrangulation Graphs

Planar Turán Number of the $Θ_{6}$

The Minimum Number of $4$ -Cycles in a Maximal Planar Graph with Small Number of Vertices

The maximum number of induced $C_{5}$ 's in a planar graph