Bounding the number of hyperedges in friendship \(r\)-hypergraphs (Q499453): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:15, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
