7 papers
On oriented Turán problems
Dániel Gerbner, Xuanrui Hu, Yuefang Sun
The oriented Turán number of a given oriented graph , denoted by $\exo(n,\overrightarrow{F})$, is the largest number of arcs in -vertex …
On Turán problems for Berge forests
Junpeng Zhou, Dániel Gerbner, Xiying Yuan
For a graph , an -uniform hypergraph is a Berge- if there is a bijection such that for each . Given a family $\…
Survey of generalized Turán problems -- counting subgraphs
Dániel Gerbner, Cory Palmer
For fixed graphs and , the \emph{generalized Turán number} is the maximum possible number of copies of a subgraph in an -vertex -free graph.…
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…