Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets (Q1158173): Difference between revisions

@@ Property / author @@
-Ioan Tomescu
@@ Property / author: Ioan Tomescu / rank @@
-Normal rank
@@ Property / author @@
+Ioan Tomescu
@@ Property / author: Ioan Tomescu / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q5668821
@@ Property / cites work: Q5668821 / rank @@
+Normal rank
@@ Property / cites work @@
+A short proof of Sperner's lemma
@@ Property / cites work: A short proof of Sperner's lemma / rank @@
+Normal rank
@@ Property / cites work @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Le nombre minimal de colorations d'un hypergraphe k-chromatique
+Normal rank
@@ Property / cites work @@
+Some properties of irreducible coverings by cliques of complete multipartite graphs
+Normal rank
@@ Property / cites work @@
+Evaluations asymptotiques du nombre des cliques des hypergraphes uniformes
+Normal rank