Back to matchesWe found a matchYour institution may have access to this item. Find your institution then sign in to continue.TitleColoring graphs of various maximum degree from random lists.AuthorsCasselgren, Carl JohanAbstractLet G = G( n) be a graph on n vertices with maximum degree Δ =Δ ( n). Assign to each vertex v of G a list L( v) of colors by choosing each list independently and uniformly at random from all k-subsets of a color setSubjectsGRAPH theory; GEOMETRIC vertices; UNIFORM algebras; SET theory; MATHEMATICAL analysisPublicationRandom Structures & Algorithms, 2018, Vol 52, Issue 1, p54ISSN1042-9832Publication typeArticleDOI10.1002/rsa.20725