6 citations · 7 across the 8 of their papers we have counts for
12 papers
Lagrangian densities of some -uniform hypergraphs
Zilong Yan, Yuejian Peng
The Lagrangian density of an -uniform hypergraph is multiplying the supremum of the Lagrangians of all -free -uniform hypergraphs. For an -uniform graph wi…
Stability of intersecting families
Yang Huang, Yuejian Peng
The celebrated Erdős-Ko-Rado theorem \cite{EKR1961} states that the maximum intersecting -uniform family on is a full star if . Furthermore, Hilton-Milner \cite…
New proofs of stability theorems on spectral graph problems
Yongtao Li, Yuejian Peng
Both the Simonovits stability theorem and the Nikiforov spectral stability theorem are powerful tools for solving exact values of Turán numbers in extremal graph theory. Recently,…
The Ramsey Number for a Forest versus Disjoint Union of Complete Graphs
Sinan Hu, Yuejian Peng
Given two graphs and , the Ramsey number is the minimum integer such that any coloring of the edges of in red or blue yields a red or a blue . Let…
Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions
Biao Wu, Yuejian Peng
For a fixed positive integer and an -uniform hypergraph , the Turán number is the maximum number of edges in an -free -uniform hypergraph on vertices,…
Lagrangian densities of hypergraph cycles
Yuejian Peng, Zilong Yan
The Lagrangian density of an -uniform hypergraph is multiplying the supremum of the Lagrangians of all -free -uniform hypergraphs. For an -graph with v…