11 papers
Counting large cliques in graphs with a forbidden tree
Junpeng Zhou, Xiying Yuan
Given graphs and , the generalized Turán number is the maximum number of copies of in an -vertex -free graph. Alon and Shikhelman (J. Combin. Th…
A Spectral Confirmation of the ErdÅs Matching Conjecture
Liying Kang, Yongchun Lu, Xiying Yuan +1
The ErdÅs Matching Conjecture concerns the maximum number of hyperedges in an -uniform hypergraph with bounded matching number. In this paper, we study a spectral counterpart o…
Counting sunflowers in hypergraphs with bounded matching number and ErdÅs Matching Conjecture in the -norm
Junpeng Zhou, Xiying Yuan
It is well known that ErdÅs Matching Conjecture concerns the maximum number of hyperedges in an -uniform hypergraph with bounded matching number. As a generalization, it is nat…
On the number of linear uniform hypergraphs with linear girth constraint
Fang Tian, Yiting Yang, Xiying Yuan
For an integer , a hypergraph on vertex set is -uniform if each edge is a set of vertices, and is said to be linear if every two distinct edges share at…
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…
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 $\…