Bounding the number of hyperedges in friendship \(r\)-hypergraphs (Q499453): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejc.2015.05.002 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJC.2015.05.002 / rank | |||
Normal rank | |||
Revision as of 02:54, 9 December 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
