activity
20182022
most citedThe maximum number of triangles in -free graphs

3 citations · 5 across the 7 of their papers we have counts for

collaborators

8 papers

math.CO2022★ 3 cited

The maximum number of triangles in -free graphs

Xiutao Zhu, Yaojun Chen, Dániel Gerbner +2

The generalized Turán number is the maximum number of complete graph in an -free graph on vertices. Let be the friendship graph consisting of t…

math.CO2022

Connectivity of friends-and-strangers graphs on random pairs

Lanchao Wang, Yaojun Chen

Consider two graphs and , each with vertices. The friends-and-strangers graph of and is a graph with vertex set consisting of all bijections $…

math.CO2022

Turán number for odd-ballooning of trees

Xiutao Zhu, Yaojun Chen

The Turán number is the maximum number of edges in an -free graph on vertices. Let be any tree. The odd-ballooning of , denoted by , is a graph obtaine…

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…

cs.NI2018★ 2 cited

How the Network Topology, Traffic Distribution, and Routing Scheme Impact on the Spectrum Usage in Elastic Optical Networks

Haitao Wu, Fen Zhou, Zuqing Zhu +1

Elastic Optical Network (EON) has been considered as a promising optical networking technology to architect the next-generation backbone networks. Routing and Spectrum Assignment (…

cs.NI2018

On Virtual Network Embedding: Paths and Cycles

Haitao Wu, Fen Zhou, Yaojun Chen +1

Network virtualization provides a promising solution to overcome the ossification of current networks, allowing multiple Virtual Network Requests (VNRs) embedded on a common infras…

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…