Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets
type: Item
instance of: scholarly article
title: Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets
zbMATH Open document ID: 0472.05052
DOI: 10.1016/0012-365X(81)90225-9
published in: Discrete Mathematics
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 3739592
zbMATH Keywords: clique-covering
zbMATH Keywords: chromatic complete
zbMATH Keywords: hypergraphs
author: Ioan Tomescu
MaRDI profile type: Publication
cites work: Q5668821
cites work: A short proof of Sperner's lemma
cites work: On cliques in graphs
cites work: Le nombre minimal de colorations d'un hypergraphe k-chromatique
cites work: Some properties of irreducible coverings by cliques of complete multipartite graphs
cites work: Evaluations asymptotiques du nombre des cliques des hypergraphes uniformes
description: scientific article; zbMATH DE number 3739592