scientific article; zbMATH DE number 3480649

MaRDI QIDQ4063192zbMATH OpenFDO

Authors F. Sterboul

Publication date 1975

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Cited in

(4)

• Smallest 3-graphs having a 3-colored edge in every k-coloring
• Un problème extremal pour les graphes et les hypergraphes
• Approximability of the upper chromatic number of hypergraphs
• A problem on triples

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 Q4063192)