scientific article; zbMATH DE number 568840

MaRDI QIDQ4294632zbMATH OpenFDO

Authors

Publication date 7 August 1994

zbMATH Keywords

boundcolorcoloringextremal problemhypergraphminimum subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Recommendations

• Colorations Extrêmes Dans Les Hypergraphes
• Edge coloring complete uniform hypergraphs with many components
• Combinatorial extremum problems for 2-colorings of hypergraphs
• On balanced colorings of hypergraphs
• Coloring uniform hypergraphs with few colors

Cited in

(15)

• Upper bound in the Erdős-Hajnal problem of hypergraph coloring
• The existence of uniform hypergraphs for which the interpolation property of complete coloring fails
• On the sizes of vertex-k-maximal r-uniform hypergraphs
• Monochromatic partitions of complete uniform hypergraphs
• scientific article; zbMATH DE number 4014765 (Why is no real title available?)
• Colorations Extrêmes Dans Les Hypergraphes
• On Some Extremal Properties of Hypergraph Colorings
• Upper bounds on minimum number of \(\mathcal{C}\)-edges of 4-uniform \(\mathcal{C}\)-hypergraphs
• scientific article; zbMATH DE number 4047752 (Why is no real title available?)
• scientific article; zbMATH DE number 4087673 (Why is no real title available?)
• scientific article; zbMATH DE number 15864 (Why is no real title available?)
• scientific article; zbMATH DE number 1047736 (Why is no real title available?)
• scientific article; zbMATH DE number 1092949 (Why is no real title available?)
• scientific article; zbMATH DE number 4183438 (Why is no real title available?)
• Edge coloring complete uniform hypergraphs with many components

This page was built for publication:

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