Dynamic choosability of triangle-free graphs and sparse random graphs

Jaehoon Kim, Seongmin Ok

The \textit{$r$-dynamic choosability} of a graph $G$, written ${\mathrm{ch}}_r(G)$, is the least $k$ such that whenever each vertex is assigned a list of at least $k$ colors a proper co…