10.18453/rosdok_id00005831 Reiher, Christian Christian Reiher http://d-nb.info/gnd/1013370627 University of Rostock, Institute of Mathematics 2008 510 Mathematics 2008 en https://purl.uni-rostock.de/rosdok/id00005831 urn:nbn:de:gbv:28-rosdok_id00005831-8 In this brief note, we give a positive answer to a question that has recently been asked by L. Addario-Berry et al. in this journal, namely: Given a graph G = (V,E) and for every vertex v ∈ V a list Dv ⋸ {0,1,...,d(v)} satisfying |Dv| >= D(v)/2 + 1, does there necessarily exist a spanning subgraph H of G such that dH(v) ∈ Dv holds for every v ∈ V?