Edge-colorings of graphs avoiding complete graphs with a prescribed coloring

Fabricio S. Benevides, Carlos Hoppen, Rudini Menezes Sampaio

Given a graph $F$ and an integer $r\ge 2$, a partition $\hat{F}$ of the edge set of $F$ into at most $r$ classes, and a graph $G$, define $c_{r,\hat{F}}(G)$ as the number…