6 papers · 1 filter
Counterexamples to a treewidth conjecture on generalized Turán problems
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. The…
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. The…
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 of…
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 natu…
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…
A stability result for Berge- -graphs and its applications
Junpeng Zhou, Xiying Yuan, Wen-Huan Wang
An -uniform hypergraph (-graph) is linear if any two edges intersect at most one vertex. For a graph , a hypergraph is Berge- if there is a bijection $ϕ:E(F)\righta…