A sharp lower bound on the number of hyperedges in a friendship 3-hypergraph (Q2866605)
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: A sharp lower bound on the number of hyperedges in a friendship 3-hypergraph |
scientific article; zbMATH DE number 6238422
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sharp lower bound on the number of hyperedges in a friendship 3-hypergraph |
scientific article; zbMATH DE number 6238422 |
Statements
13 December 2013
0 references
universal friend 3-hypergraph
0 references
A sharp lower bound on the number of hyperedges in a friendship 3-hypergraph (English)
0 references
