The List Edge-Coloring Conjecture for New Infinite Families

The List Edge-Coloring Conjecture predicts that any graph whose edges can be colored with $k$ colors can also be colored from arbitrary lists of $k$ colors. We prove its stronger online form for two new infinite families, $K_{p-1}$ and $K_{2p}$, where $p$ is an odd prime. For even $n$, order the ver