Rainbow Turán Problems for Paths and Forests of Stars

[摘要] For a fixed graph $F$, we would like to determine the maximum number of edges in a properly edge-colored graph on $n$ vertices which does not contain a rainbow copy of $F$, that is, a copy of $F$ all of whose edges receive a different color. This maximum,

[学科分类] 离散数学和组合数学

[关键词] Rainbow Turán numbers;Paths;Stars