Coloring graphs from random lists

DOI10.1002/RSA.21278MaRDI QIDQ7027463zbMATH OpenFDO

Authors Dan Hefetz, Michael Krivelevich

Publication date 14 February 2025

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/RSA.21278

zbMATH Keywords

graph colouringlist colouringpalette sparsificationrandom lists

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites work

• A distributed palette sparsification theorem
• A note on odd cycle-complete graph Ramsey numbers
• A note on pseudorandom Ramsey graphs
• A parallel algorithmic version of the local lemma
• Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
• Asymptotic upper bounds for Ramsey functions
• Avoiding Arrays of Odd Order by Latin Squares
• Choice Numbers of Graphs: a Probabilistic Approach
• Coloring complete and complete bipartite graphs from random lists
• Coloring complete bipartite graphs from random lists
• Coloring graphs from random lists of fixed size
• Coloring graphs from random lists of size 2
• Coloring graphs of various maximum degree from random lists
• Colouring powers of cycles from random lists
• Cycles in triangle-free graphs of large chromatic number
• Dynamic concentration of the triangle‐free process
• Graph Theory and Probability
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 1534644 (Why is no real title available?)
• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• scientific article; zbMATH DE number 3251276 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• scientific article; zbMATH DE number 7758308 (Why is no real title available?)
• On the asymptotic value of the choice number of complete multi‐partite graphs
• Ramsey numbers and the Zarankiewicz problem
• Random minimum length spanning trees in regular graphs
• Sublinear algorithms for ( + 1) vertex coloring
• The asymptotics of r(4,t)
• The early evolution of the \(H\)-free process
• The triangle-free process and the Ramsey number \(R(3,k)\)
• Vertex coloring complete multipartite graphs from random lists of size 2

This page was built for publication: Coloring graphs from random lists

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7027463)