4 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…
Turán problems for star-path forests in hypergraphs
Junpeng Zhou, Xiying Yuan
An -uniform hypergraph (-graph for short) is linear if any two edges intersect at most one vertex. Let be a given family of -graphs. An -graph is call…