Stacie Baumann

Embedding equitable (s,p)-edge-colorings of $K_n$

An $(s,p)$-edge-coloring of a graph $G$ is an edge coloring using $s$ colors such that exactly $p$ colors appear at each vertex. To generalize the notion of proper edge-coloring, these colorings are defined to be equitable: the numbers of edges of each color incident to a vertex are fairly distributed. We find the nece...