Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets

DOI10.1016/0012-365X(81)90225-9zbMath0472.05052MaRDI QIDQ1158173

Ioan Tomescu

Publication date: 1981

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

hypergraphschromatic completeclique-covering

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Trees with maximum number of maximal matchings ⋮ On the number of minimal transversals in 3-uniform hypergraphs

Cites Work

• Unnamed Item
• Evaluations asymptotiques du nombre des cliques des hypergraphes uniformes
• Some properties of irreducible coverings by cliques of complete multipartite graphs
• Le nombre minimal de colorations d'un hypergraphe k-chromatique
• A short proof of Sperner's lemma
• On cliques in graphs

This page was built for publication: Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets