3 citations · 4 across the 5 of their papers we have counts for
4 papers · 1 filter
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…
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…