9 papers · 1 filter
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…