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

DOI10.1007/BF03322101zbMATH Open0933.05105OpenAlexW2076811511MaRDI QIDQ1306277FDOQ1306277

Klaus Dohmen

Publication date: 4 October 1999

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

Full work available at URL: https://doi.org/10.1007/bf03322101

Recommendations

• A contribution to the chromatic theory of uniform hypergraphs
• On coloring uniform hypergraphs without 3-cycles
• ON HYPERGRAPH COLOURINGS
• Upper bounds on minimum number of \(\mathcal{C}\)-edges of 4-uniform \(\mathcal{C}\)-hypergraphs

zbMATH Keywords

chromatic numbercolouringboundchromatic polynomialcyclesuniform hypergraph

Mathematics Subject Classification ID

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

Cites Work

• A contribution to the chromatic theory of uniform hypergraphs

Cited In (6)

• Zero-free intervals of chromatic polynomials of hypergraphs
• 3-uniform hypergraphs without a cycle of length five
• ON HYPERGRAPH COLOURINGS
• A contribution to the chromatic theory of uniform hypergraphs
• A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
• On 3-uniform hypergraphs without a cycle of a given length

This page was built for publication: An upper bound to the chromatic number of a uniform hypergraph without cycles of length two or three

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