Coloring hypergraphs from random lists

DOI10.37236/12810MaRDI QIDQ6671607FDOQ6671607

Authors: Carl Johan Casselgren 

Publication date: 27 January 2025

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Recommendations

• Coloring graphs from random lists of fixed size
• Coloring graphs of various maximum degree from random lists
• Near-optimal list colorings
• Coloring graphs from random lists of size 2
• On the chromatic index of random uniform hypergraphs

zbMATH Keywords

\(r\)-uniform hypergraphrandomly chosen color lists

Mathematics Subject Classification ID

Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Cites Work

• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Colouring powers of cycles from random lists
• Coloring complete and complete bipartite graphs from random lists
• Coloring complete bipartite graphs from random lists
• Avoiding Arrays of Odd Order by Latin Squares
• Vertex coloring complete multipartite graphs from random lists of size 2
• Coloring graphs from random lists of fixed size
• Coloring graphs from random lists of size 2
• Many Cliques in Bounded-Degree Hypergraphs
• On the threshold problem for Latin boxes
• A general framework for hypergraph coloring
• Coloring graphs of various maximum degree from random lists
• Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor
• Title not available (Why is that?)
• Optimal thresholds for Latin squares, Steiner triple systems, and edge colorings

Cited In (1)

• A note on rainbow stackings of random edge-colorings of hypergraphs

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

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