On \((k, k n - k^2 - 2 k - 1)\)-choosability of \(n\)-vertex graphs (Q1751381)

Summary: A \((k, t)\)-list assignment \(L\) of a graph \(G\) is a mapping which assigns a set of size \(k\) to each vertex \(v\) of \(G\) and \(| \bigcup_{v \in V(G)} L(v) | = t\). A graph \(G\) is \((k, t)\)-choosable if \(G\) has a proper coloring \(f\) such that \(f(v) \in L(v)\) for each \((k, t)\)-list assignment \(L\). \textit{W. Charoenpanitseri} et al. [Ars Comb. 99, 321--333 (2011; Zbl 1265.05217)] gave a characterization of \((k, t)\)-choosability of \(n\)-vertex graphs when \(t \geq k n - k^2 - 2 k + 1\) and left open problems when \(t \leq k n - k^2 - 2 k\). Recently, \textit{W. Ruksasakchai} and \textit{K. Nakprasit} [Ars Comb. 111, 375--387 (2013; Zbl 1313.05129)] obtain the results when \(t = k n - k^2 - 2 k\). In this paper, we extend the results to case \(t = k n - k^2 - 2 k - 1\).