11 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…
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…