7 papers
On the codegree Turán density of projective geometries
Xiaona Fang, Yaojun Chen
Let be a -uniform hypergraph, abbreviated as -graph. The codegree Turán density is the supremum over all such that, for arbitrarily large , ther…
On linear -graphs with codegree Turán density arbitrarily close to zero
Xiaona Fang, Yaojun Chen
Let be a -uniform hypergraph, abbreviated as -graph. The codegree Turán density is the supremum over all such that, for arbitrarily l…
On the threshold Ramsey multiplicity conjectures for paths and even cycles
Ting Huang, Jiabao Yang, Yaojun Chen
The Ramsey number of a graph is the minimum positive integer such that every red/blue edge-coloring of the complete graph on vertices contains a monochroma…
Ramsey numbers and Gallai--Ramsey numbers of disjoint unions of cherries
Yanbo Zhang, Qian Chen, Yaojun Chen
For graphs , the Ramsey number is the smallest positive integer such that every -edge-coloring of contains a monochromatic copy of…
New bounds for Ramsey numbers involving graphs with a center
Yanbo Zhang, Yaojun Chen
Let , , and be the graphs obtained by joining a vertex to independent edges, a cycle and a path of order , respectively. In this paper, we give n…
Oriented Ramsey numbers of some sparse graphs
Junying Lu, Yaojun Chen
Let be an oriented graph without directed cycle. The oriented Ramsey number of , denoted by , is the smallest integer such that every tournament o…