List packing is a notion that was introduced in 2021 (by Cambie et al.). The list packing
number of a graph G, denoted χ ℓ⁎(G), is the least k such that for any list assignment L that …

Flexible list coloring was introduced by Dvořák, Norin, and Postle in 2019. Suppose 0≤ ϵ≤
1 0≤ϵ≤1, GG is a graph, LL is a list assignment for GG, and rr is a function with nonempty …

Given a list assignment for a graph, list packing asks for the existence of multiple pairwise
disjoint list colorings of the graph. Several papers have recently appeared that study the …

For a graph $ G $ and a list assignment $ L $ with $| L (v)|= k $ for all $ v $, an $ L $-packing
consists of $ L $-colorings $\varphi_1,\cdots,\varphi_k $ such that $\varphi_i (v)\ne\varphi_j …

Consider a multipartite graph $ G $ with maximum degree at most $ no (n) $, parts $
V_1,\ldots, V_k $ have size $| V_i|= n $, and every vertex has at most $ o (n) $ neighbors in …

We study the problem of approximately counting the number of list packings of a graph. The
analogous problem for usual vertex coloring and list coloring has attracted a lot of attention …

The fractional list packing number $\chi_ {\ell}^{\bullet}(G) $ of a graph $ G $ is a graph
invariant that has recently arisen from the study of disjoint list-colourings. It measures how …

Two L-colourings ci, cj are disjoint if ci (u)= cj (u) for every u∈ V (G). The list-chromatic
number (or choosability) χℓ (G) of a graph is the minimum integer k such that every k-list …