4 citations · 6 across the 8 of their papers we have counts for
6 papers
Mixed pairwise cross intersecting families (I)
Yang Huang, Yuejian Peng
An -cross intersecting system is a set of non-empty pairwise cross-intersecting families $\mathcal{F}_1\subset{[n]\choose k_1}, \mathcal{F}_2\subset{[n]\choos…
Tree Embeddings and Tree-Star Ramsey Numbers
Zilong Yan, Yuejian Peng
We say that a graph can be embedded into a graph if contains an isomorphic copy of as a subgraph. Guo and Volkmann \cite{GV} conjectured that if is a connected…
Non-jumping Turán densities of hypergraphs
Zilong Yan, Yuejian Peng
A real number is a jump for an integer if there exists such that no number in can be the Turán density of a family of -uniform graphs. A…
An irrational Lagrangian density of a single hypergraph
Zilong Yan, Yuejian Peng
The {\em Turán number} of an -uniform graph , denoted by , is the maximum number of edges in an -free -uniform graph on vertices. The {\em Turán density} o…
Dense -uniform hypergraphs containing a large clique
Biao Wu, Yuejian Peng
An -uniform graph is dense if and only if every proper subgraph of satisfies , where is the Lagrangian of a hypergraph . In 1980's, Sidorenk…
Turan numbers of extensions of some sparse hypergraphs via Lagrangians
Tao Jiang, Yuejian Peng, Biao Wu
Given a positive integer and an -uniform hypergraph (or -graph for short) , the Turan number of is the maximum number of edges in an -graph on ver…