A contribution to the chromatic theory of uniform hypergraphs

DOI10.1007/BF03322239zbMath0831.05029MaRDI QIDQ1896647

Klaus Dohmen

Publication date: 18 October 1995

Published in: Results in Mathematics (Search for Journal in Brave)

zbMATH Keywords

hypergraphboundschromatic number

Mathematics Subject Classification ID

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

Related Items

Bounds to the chromatic polynomial of a graph ⋮ An upper bound to the chromatic number of a uniform hypergraph without cycles of length two or three

Cites Work

• Unnamed Item
• Hypertrees and Bonferroni inequalities
• A broken-circuits-theorem for hypergraphs
• The \(B_r\) property and chromatic numbers of generalized graphs
• New upper bounds for the greatest number of proper colorings of a (V,E)‐graph
• Lower bounds and upper bounds for chromatic polynomials