Counting Small Cliques in 3-uniform Hypergraphs (Q4680574)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 2173897
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting Small Cliques in 3-uniform Hypergraphs |
scientific article; zbMATH DE number 2173897 |
Statements
Counting Small Cliques in 3-uniform Hypergraphs (English)
0 references
7 June 2005
0 references
regularity lemma
0 references
quasi-randomness
0 references
counting lemma
0 references
0.8623987436294556
0 references
0.8444225788116455
0 references
0.835280179977417
0 references
0.8258894681930542
0 references
0.8258894085884094
0 references
