2 citations · 2 across the 4 of their papers we have counts for
11 papers
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…
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…
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…