Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets (Q1158173): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5668821 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A short proof of Sperner's lemma / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On cliques in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Le nombre minimal de colorations d'un hypergraphe k-chromatique / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some properties of irreducible coverings by cliques of complete multipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Evaluations asymptotiques du nombre des cliques des hypergraphes uniformes / rank | |||
Normal rank | |||
Latest revision as of 13:07, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets |
scientific article |
Statements
Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets (English)
0 references
1981
0 references
clique-covering
0 references
chromatic complete
0 references
hypergraphs
0 references
