7 citations · 28 across the 34 of their papers we have counts for
6 papers · 1 filter
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…
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…