7 citations · 21 across the 14 of their papers we have counts for
22 papers
Packing independent cliques into planar graphs
Csaba Biró, Gabriel Collado, Oscar Zamora
The indeque number of a graph is largest set of vertices that induce an independent set of cliques. We study the extremal value of this parameter for the class and subclasses of pl…
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…
Inverse Turán numbers
Ervin Győri, Nika Salia, Casey Tompkins +1
For given graphs and , the Turán number is defined to be the maximum number of edges in an -free subgraph of . Foucaud, Krivelevich and Perarnau and later in…
A note on the Turán number of disjoint union of wheels
Chuanqi Xiao, Oscar Zamora
The Turán number of a graph , , is the maximum number of edges in a graph on vertices which does not have as a subgraph. A wheel is an -vertex g…
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…
Saturation problems in the Ramsey theory of graphs, posets and point sets
Gábor Damásdi, Balázs Keszegh, David Malec +3
In 1964, Erdős, Hajnal and Moon introduced a saturation version of Turán's classical theorem in extremal graph theory. In particular, they determined the minimum number of edges in…
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…
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…
Independent Chains in Acyclic Posets
Nika Salia, Christoph Spiegel, Casey Tompkins +1
We consider the problem of determining the maximum order of an induced vertex-disjoint union of cliques in a graph. More specifically, given some family of graphs of…
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 Turán number of the square of a path
Chuanqi Xiao, Gyula O. H. Katona, Jimeng Xiao +1
The Turán number of a graph H, ex(n,H), is the maximum number of edges in a graph on n vertices which does not have H as a subgraph. Let P_k be the path with k vertices, the square…
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 -vertex, -uniform, connected, hypergraph with…
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…
Turán numbers of Berge trees
Ervin Győri, Nika Salia, Casey Tompkins +1
A classical conjecture of Erdős and Sós asks to determine the Turán number of a tree. We consider variants of this problem in the settings of hypergraphs and multi-hypergraphs. In…
The Structure of Hypergraphs without long Berge cycles
Ervin Győri, Nathan Lemons, Nika Salia +1
We study the structure of -uniform hypergraphs containing no Berge cycles of length at least for , and determine that such hypergraphs have some special substructu…
Ramsey numbers of Berge-hypergraphs and related structures
Nika Salia, Casey Tompkins, Zhiyu Wang +1
For a graph , a hypergraph is called a Berge-, denoted by , if there exists a bijection such that for every ,…
The maximum number of copies in -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 copies in an -free graph, for a pair of graphs …
An Erdős-Gallai type theorem for vertex colored graphs
Nika Salia, Casey Tompkins, Oscar Zamora
While investigating odd-cycle free hypergraphs, Győri and Lemons introduced a colored version of the classical theorem of Erdős and Gallai on -free graphs. They proved that an…