4 citations · 4 across the 10 of their papers we have counts for
10 papers · 1 filter
Finite palette endpoints and degree-square Turán problems
Jiangdong Ai, Bin Chen, Ming Chen +2
We study finite palette extremal problems motivated by uniform Turán densities of -uniform hypergraphs. Given a self-converse tournament with at least two vertices, we deter…
Intersecting families with full difference sets
Yan zilong, Peng Yuejian
For a family of subsets of a finite set, define . A family is called intersecting if $F…
Chromatic profiles of odd cycles
Zilong Yan, Yuejian Peng, Xiaoli Yuan
Erdős and Simonovits asked the following question: For an integer and a family of non-bipartite graphs , what is the infimum of such that any $\mathcal{F…
A strong structural stability of -free graphs
Zilong Yan, Yuejian Peng
Füredi and Gunderson showed that is achieved only on if . It is natural to study how far a $ C…
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…
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…
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…