Smallest 3-graphs having a 3-colored edge in every k-coloring
type: Item
instance of: scholarly article
title: Smallest 3-graphs having a 3-colored edge in every k-coloring
zbMATH Open document ID: 0408.05041
DOI: 10.1016/0012-365X(79)90111-0
author: F. Sterboul
published in: Discrete Mathematics
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 3634299
zbMATH Keywords: Hypergraphs
zbMATH Keywords: Colorings
zbMATH Keywords: Extremal Problems
zbMATH Keywords: 3-Graph
MaRDI profile type: Publication
cites work: Q5615282
cites work: Q4063192
cites work: A problem on triples
cites work: Q4168938
cites work: Un Probleme De Coloration Aux Aspects Varies
description: scientific article; zbMATH DE number 3634299