Coloring d-embeddable k-uniform hypergraphs

MaRDI QIDQ5419987zbMATH OpenFDO

Authors Carl Georg Heise, Oleg Pikhurko, Anusch Taraz, Konstantinos Panagiotou

Publication date 11 June 2014

zbMATH Keywords

maximum chromatic number of hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• Coloring \(d\)-embeddable \(k\)-uniform hypergraphs
• Coloring uniform hypergraphs with few colors
• Upper bounds on minimum number of \(\mathcal{C}\)-edges of 4-uniform \(\mathcal{C}\)-hypergraphs
• On the chromatic number of \(\mathbb R^4\)
• A contribution to the chromatic theory of uniform hypergraphs

Cited in

(5)

• The coloring complex and cyclic coloring complex of a complete k-uniform hypergraph
• Coloring \(d\)-embeddable \(k\)-uniform hypergraphs
• On the edge-chromatic number of 2-complexes
• Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\)
• The existence of uniform hypergraphs for which the interpolation property of complete coloring fails

This page was built for publication: Coloring \(d\)-embeddable \(k\)-uniform hypergraphs

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