Year: 2018
Type: article
Abstract: The aim of this note is twofold. On the one hand, we present a streamlined version of Molloy's new proof of the bound for triangle‐free graphs G, avoiding the technicalities of the entropy compression method and only using the usual “lopsided” Lovász Local Lemma (albeit in a somewhat unusual setting). On the other hand, we extend Molloy's result to DP‐coloring (also known as correspondence coloring), a generalization of list coloring introduced recently by Dvořák and Postle.
Source: Random Structures and Algorithms
DOI: 10.1002/rsa.20811
Author: Anton Bernshteyn
Institution: University of Illinois Urbana-Champaign
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2747439166