2 citations · 2 across the 2 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2021
Generalized Turán number for linear forests
Xiutao Zhu, Yaojun Chen
The generalized Turán number is defined to be the maximum number of copies of a complete graph in any -free graph on vertices. Let be a linear forest…
math.CO2019
Gallai-Ramsey number of even cycles with chords
Fangfang Zhang, Zi-Xia Song, Yaojun Chen
For a graph and an integer , the -color Ramsey number is the least integer such that every -coloring of the edges of the complete graph contains…
math.CO2018
Gallai-Ramsey number of odd cycles with chords
Fangfang Zhang, Zi-Xia Song, Yaojun Chen
A Gallai coloring is a coloring of the edges of a complete graph without rainbow triangles, and a Gallai -coloring is a Gallai coloring that uses at most colors. For an inte…