Bounding the number of hyperedges in friendship \(r\)-hypergraphs (Q499453)
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: Bounding the number of hyperedges in friendship r-hypergraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounding the number of hyperedges in friendship \(r\)-hypergraphs |
scientific article |
Statements
Bounding the number of hyperedges in friendship \(r\)-hypergraphs (English)
0 references
30 September 2015
0 references
friendship graph
0 references
friendship 3-hypergraphs
0 references
geometric friendship designs
0 references
bounds
0 references
computer algorithm
0 references
enumeration
0 references
0.8709216117858887
0 references
0.849848747253418
0 references
0.8268123865127563
0 references
0.8152741193771362
0 references
0.7538607120513916
0 references
