The Johansson‐Molloy theorem for DP‐coloring

The aim of this note is twofold. On the one hand, we present a streamlined version of Molloy's new proof of the bound χ(G)≤(1+o(1))Δ(G)/lnΔ(G) for triangle‐free graphs G, avoiding the technicalities of the entropy compression method and only using the usual “lopsided” Lovász Local Lemma (albeit...

Full description

Bibliographic Details

Published in:	Random structures & algorithms Vol. 54; no. 4; pp. 653 - 664
Main Author:	Bernshteyn, Anton
Format:	Journal Article
Language:	English
Published:	New York John Wiley & Sons, Inc 01.07.2019 Wiley Subscription Services, Inc
Subjects:	Coloring DP‐coloring entropy compression Graph coloring list coloring Local Lemma triangle‐free graphs
ISSN:	1042-9832, 1098-2418
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!