Upper bounds on minimum number of C-edges of 4-uniform C-hypergraphs

MaRDI QIDQ3540512zbMATH OpenFDO

Authors Kefeng Diao, Guizhen Liu

Publication date 24 November 2008

zbMATH Keywords

strict coloringuniform hypergraphupper chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Extremal set theory (05D05)

Recommendations

• A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
• On the coloring of C-hypergraphs with minimum connected pair graphs
• Colorings of hypergraphs with large number of colors
• scientific article; zbMATH DE number 568840
• Coloring uniform hypergraphs with few colors

Cited in

(7)

• An upper bound to the chromatic number of a uniform hypergraph without cycles of length two or three
• About the upper chromatic number of a co-hypergraph
• The minimum chromatic spectrum of 3-uniform \(\mathcal{C}\)-hypergraphs
• Coloring \(d\)-embeddable \(k\)-uniform hypergraphs
• Coloring four-uniform hypergraphs on nine vertices
• Coloring d-embeddable k-uniform hypergraphs
• On the coloring of C-hypergraphs with minimum connected pair graphs

This page was built for publication: Upper bounds on minimum number of \(\mathcal{C}\)-edges of 4-uniform \(\mathcal{C}\)-hypergraphs

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