Deterministic Hypergraph Coloring and Its Applications

DOI10.1137/S0895480100367664MaRDI QIDQ4652639zbMATH OpenOpenAlexFDO

Authors Chi-Jen Lu

Publication date 28 February 2005

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480100367664

zbMATH Keywords

approximate countingapproximation algorithmderandomizationLovász local lemmapartially ordered set

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Combinatorics in computer science (68R05) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 1301963
• Approximating Independent Set and Coloring in Random Uniform Hypergraphs
• Approximate hypergraph coloring
• scientific article; zbMATH DE number 1002208
• scientific article; zbMATH DE number 1947044

Cited in

(7)

• Correlation decay and deterministic FPTAS for counting colorings of a graph
• scientific article; zbMATH DE number 1301963 (Why is no real title available?)
• scientific article; zbMATH DE number 1305459 (Why is no real title available?)
• An algebraic formulation of hypergraph colorings
• On perfect balanced rainbow-free colorings and complete colorings of projective spaces
• A fast coloring oracle for average case hypergraphs
• Improved algorithms for colorings of simple hypergraphs and applications

This page was built for publication: Deterministic Hypergraph Coloring and Its Applications

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