The list chromatic number of graphs with small clique number

Michael Molloy

Type: Article

Publication Date: 2018-07-13

Citations: 74

DOI: https://doi.org/10.1016/j.jctb.2018.06.007

View Publication

Locations

Journal of Combinatorial Theory Series B - View
arXiv (Cornell University) - View - PDF

Similar Works

Action	Title	Year	Authors
+	The list chromatic number of graphs with small clique number	2017	Michael Molloy
+	The list chromatic number of graphs with small clique number	2017	Michael Molloy
+ PDF Chat	Bipartite graphs are $(\frac{4}{5}-\varepsilon) \frac{\Delta}{\log \Delta}$-choosable	2024	Peter Bradshaw Bojan Mohar Ladislav Stacho
+	A note on list‐colorings	1989	Amanda G. Chetwynd Roland Häggkvist
+	Subgraphs of large connectivity and chromatic number	2020	António Girão Bhargav Narayanan
+ PDF Chat	List-Coloring Claw-Free Graphs with $\Delta-1$ Colors	2017	Daniel W. Cranston Landon Rabern
+	Bounding $\chi$ by a fraction of $\Delta$ for graphs without large cliques	2018	Marthe Bonamy Tom Kelly Peter Nelson Luke Postle
+	List-Coloring Claw-Free Graphs with Small Clique Number	2012	Louis Esperet András Gyárfás Frédéric Maffray
+	Bounding $χ$ by a fraction of $Δ$ for graphs without large cliques	2018	Marthe Bonamy Tom Kelly Peter S. Nelson Luke Postle
+ PDF Chat	Subgraphs of large connectivity and chromatic number	2022	António Girão Bhargav Narayanan
+	Dense uniform hypergraphs have high list chromatic number	2011	Noga Alon Alexandr Kostochka
+	List Coloring Triangle-Free Hypergraphs	2013	Jeff Cooper Dhruv Mubayi
+	List Coloring Triangle-Free Hypergraphs	2013	Jeff Cooper Dhruv Mubayi
+	List colouring of graphs with at most $\big(2-o(1)\big)\chi$ vertices	2003	Bruce Reed Benny Sudakov
+	Bipartite induced density in triangle-free graphs	2018	Wouter Cames van Batenburg Rémi de Joannis de Verclos Ross J. Kang François Pirot
+	Bipartite induced density in triangle-free graphs	2018	Wouter Cames van Batenburg Rémi de Joannis de Verclos Ross J. Kang François Pirot
+	Sufficient sparseness conditions for G^2 to be (Δ+1)-choosable, when Δ\ge5	2013	Daniel W. Cranston Riste Škrekovski
+ PDF Chat	On the List Coloring Version of Reed's Conjecture	2017	Michelle Delcourt Luke Postle
+	The chromatic number of triangle-free graphs	1972	Hudson V. Kronk
+	A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs	2002	Van H. Vu

Works That Cite This (70)

Action	Title	Year	Authors
+	Graph structure via local occupancy	2020	Ewan Davies Ross J. Kang François Pirot Jean‐Sébastien Sereni
+	Efficiently list‐edge coloring multigraphs asymptotically optimally	2022	Fotis Iliopoulos Alistair Sinclair
+	Counting colorings of triangle-free graphs	2021	Anton Bernshteyn Tyler Brazelton Ruijia Cao Akum Kang
+ PDF Chat	Some Results on Chromatic Number as a Function of Triangle Count	2019	David G. Harris
+	Bounding $\chi$ by a fraction of $\Delta$ for graphs without large cliques	2018	Marthe Bonamy Tom Kelly Peter Nelson Luke Postle
+	Asymmetric list sizes in bipartite graphs	2020	Noga Alon Stijn Cambie Ross J. Kang
+ PDF Chat	Coloring triangle‐free graphs with local list sizes	2020	Ewan Davies Rémi de Joannis de Verclos Ross J. Kang François Pirot
+	Packing list-colourings.	2021	Stijn Cambie Wouter Cames van Batenburg Ewan Davies Ross J. Kang
+	Measurable versions of the Lovász Local Lemma and measurable graph colorings	2019	Anton Bernshteyn
+ PDF Chat	Separation Choosability and Dense Bipartite Induced Subgraphs	2019	Louis Esperet Ross J. Kang Stéphan Thomassé

Works Cited by This (23)

Action	Title	Year	Authors
+ PDF Chat	On the Facial Thue Choice Index via Entropy Compression	2013	Jakub Przybyło
+	Infinite and Finite Sets	2003	Ethan D. Bloch
+	A note on the independence number of triangle-free graphs	1983	James B. Shearer
+	Random Walks That Find Perfect Objects and the Lovász Local Lemma	2016	Dimitris Achlioptas Fotis Iliopoulos
+	None	1999	Katherine Heinrich Jiping Liu Min‐Li Yu
+	Coloring Graphs with Sparse Neighborhoods	1999	Noga Alon Michael Krivelevich Benny Sudakov
+	Acyclic edge-coloring using entropy compression	2013	Louis Esperet Aline Parreau
+	Independence numbers of locally sparse graphs and a Ramsey type problem	1996	Noga Alon
+ PDF Chat	On Turán’s theorem for sparse graphs	1981	Miklós Ajtai Paul Erdős János Komlós Endre Szemerédi
+ PDF Chat	Nonrepetitive colouring via entropy compression	2015	Vida Dujmović Gwenaël Joret Jakub Kozik David R. Wood