4 citations · 4 across the 10 of their papers we have counts for
4 papers · 1 filter
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…
The bipartite Ramsey number
Zilong Yan, Yuejian Peng
Given bipartite graphs , \dots , , the bipartite Ramsey number is the minimum integer such that any -edge-coloring of complete bipartite graph…