The maximum number of 3- and 4-cliques within a planar maximally filtered graph (Q1783249)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The maximum number of 3- and 4-cliques within a planar maximally filtered graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum number of 3- and 4-cliques within a planar maximally filtered graph |
scientific article |
Statements
The maximum number of 3- and 4-cliques within a planar maximally filtered graph (English)
0 references
20 September 2018
0 references
planar maximally filtered graphs
0 references
correlation based networks
0 references
3- and 4-cliques
0 references
Eberhard's operation
0 references
standard spherical triangulation
0 references
0.89598644
0 references
0.89549255
0 references
0.8793689
0 references
0.87606037
0 references
0.8760435
0 references
0.8751116
0 references
0.87462115
0 references
0.87076986
0 references
0.86889243
0 references
