12 papers
On the generalized Turán number of the complete bipartite graph
Jing Wang, Zixuan Yang, Junpeng Zhou
For graphs and , let denote the maximum number of copies of in an -vertex -free graph. Very recently, Janzer, Longbrake, and Yepremyan proved…
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…
Hypergraph extensions of the Alon--Frankl Theorem and rainbow Turán problems
Xiamiao Zhao, Yuanpei Wang, Junpeng Zhou
Given a graph , the -expansion of is the -uniform hypergraph obtained from by inserting new distinct vertices in each edge of . Recently, Alon…
On the connected Turán number of Berge paths and Berge cycles
Xiamiao Zhao, Dániel Gerbner, Junpeng Zhou
Given a graph , a Berge copy of (Berge- for short) is a hypergraph obtained by enlarging the edges arbitrarily. Győri, Salia and Zamora determined the maximum number of h…
Forbidding edge-critical graphs as trace in uniform hypergraphs
Yichen Wang, Xin Cheng, Ervin Győri +3
We say a hypergraph contains a graph as trace if there exists a vertex subset such that and $\{e \cap S \mid e \in E(\ma…
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 generalized Turán problems for expansions
Junpeng Zhou, Xiamiao Zhao, Xiying Yuan
Given a graph , the -expansion of is the -uniform hypergraph obtained from by inserting new distinct vertices in each edge of . Given -uniform hy…
The Turán number of Berge matchings
Yichen Wang, Zixuan Yang, Xiamiao Zhao +2
Given a graph , an -uniform hypergraph is a {\em Berge-} if there is a bijection such that for each .…
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 $\ma…
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 hypergraph Turán problems with bounded matching number
Dániel Gerbner, Casey Tompkins, Junpeng Zhou
Very recently, Alon and Frankl, and Gerbner studied the maximum number of edges in -vertex -free graphs with bounded matching number, respectively. We consider the analogous…