3 citations · 3 across the 11 of their papers we have counts for
11 papers
On the Turán number of the expansion of the book
Xin Cheng, Dániel Gerbner, Hilal Hama Karim
The book with pages is the graph on vertices consisting of triangles which intersect at exactly one common edge. For a given graph , the -expansion of …
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,…
On Turán-type problems and the abstract chromatic number
Dániel Gerbner, Hilal Hama Karim, Gaurav Kucheriya
In 2020, Coregliano and Razborov introduced a general framework to study limits of combinatorial objects, using logic and model theory. They introduced the abstract chromatic numbe…
Generalized planar Turán numbers related to short cycles
Ervin Győri, Hilal Hama Karim
Given two graphs and , the generalized planar Turán number is the maximum number of copies of that an -vertex -free planar graph c…
Generalized regular Turán numbers
Dániel Gerbner, Hilal Hama Karim
We combine two generalizations of ordinary Turán problems. Given graphs and and a positive integer , we study , which is the largest number of copies of $…
The maximum number of triangles in -free graphs
Xiutao Zhu, Yaojun Chen, Dániel Gerbner +2
The generalized Turán number is the maximum number of complete graph in an -free graph on vertices. Let be the friendship graph consisting of t…