Coloring simple hypergraphs

DOI10.1016/J.JCTB.2013.09.003MaRDI QIDQ6983175zbMATH OpenFDO

Authors Alan Frieze, Dhruv Mubayi

Publication date 15 May 2025

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2013.09.003

zbMATH Keywords

hypergraph coloringsemi-random method

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Cites work

• A Lower Bound for Heilbronn'S Problem
• Asymptotically good list-colorings
• Coloring H-free hypergraphs
• Coloring graphs with sparse neighborhoods
• Concentration of multivariate polynomials and its applications
• Extremal uncrowded hypergraphs
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• On a packing and covering problem
• On Brooks' Theorem for Sparse Graphs
• On the chromatic number of set systems
• On the chromatic number of simple triangle-free triple systems
• On Turan's theorem for sparse graphs
• On uncrowded hypergraphs
• Sparse Parity-Check Matrices over ${GF(q)}$
• The probabilistic method. With an appendix on the life and work of Paul Erdős.

Cited in

(6)

• Independent sets in hypergraphs
• Approximate hypergraph vertex cover and generalized Tuza's conjecture
• List colorings of k-partite k-graphs
• Balanced independent sets and colorings of hypergraphs
• Inapproximability of counting hypergraph colourings
• Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings

This page was built for publication: Coloring simple hypergraphs

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