Long-Tu Yuan

activity

20162026

most citedAnti-Ramsey numbers of graphs with some decomposition family sequences

5 citations · 14 across the 18 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019

Extremal graphs for edge blow-up of graphs

Long-Tu Yuan

Given a graph $H$ and an integer $p$ , the {\it edge blow-up} of $H$ , denoted as $H^{p + 1}$ , is the graph obtained from replacing each edge in $H$ by a clique of size $p + 1$ where the…

math.CO2019★ 5 cited

Anti-Ramsey numbers of graphs with some decomposition family sequences

Long-Tu Yuan, Xiao-Dong Zhang

For a given graph $H$ , the anti-Ramsey number of $H$ is the maximum number of colors in an edge-coloring of a complete graph which does not contain a rainbow copy of $H$ . In this p…