7 papers
On the Turán number of blow-ups of
Xiamiao Zhao, Xin Cheng, Dániel Gerbner +4
Let denote the -uniform hypergraph on the vertex set with hyperedges . Recently, Balogh, Clemen and Lu…
Induced planar Turán numbers
Ervin GyÅri, Hilal Hama Karim
The planar Turá number of a graph is the maximum number of edges an -vertex -free planar graph can have. We study the case where is forbidden as an induced subgraph,…
On the largest chromatic number of -free hypergraphs
Yichen Wang, Mengyu Duan, Dániel Gerbner +1
Given a hypergraph , what is the largest chromatic number that an -free hypergraph can have? In the case of graphs, this question is easy to answer: the chromatic number is u…
The Turán number of Berge paths
Xin Cheng, Dániel Gerbner, Hilal Hama Karim +2
A Berge path of length in an -uniform hypergraph is a collection of hyperedges and vertices such that for…
On the Turán number of the expansion of the -fan
Xin Cheng, Dániel Gerbner, Hilal Hama Karim +1
The -fan is the graph on vertices consisting of triangles which intersect at exactly one common vertex. For a given graph , the -expansion of is the $…
On Turán problems for suspension hypergraphs
Xin Cheng, Dániel Gerbner, Hilal Hama Karim +1
For a given graph , the -uniform suspension of is the -uniform hypergraph obtained from by taking new vertices and adding them to every edge. In this paper,…