On the spectrum and linear programming bound for hypergraphs (Q2143404)
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: On the spectrum and linear programming bound for hypergraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the spectrum and linear programming bound for hypergraphs |
scientific article |
Statements
On the spectrum and linear programming bound for hypergraphs (English)
0 references
31 May 2022
0 references
regular hypergraph
0 references
adjacency matrix
0 references
Alon-Boppana theorem
0 references
degree-diameter problem
0 references
0 references
0 references
0 references
0.7927194833755493
0 references
0.7904472947120667
0 references
0.7880862355232239
0 references
0.7873324155807495
0 references
0.7859709858894348
0 references
