On the spectrum and linear programming bound for hypergraphs (Q2143404): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q114184725 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3083511639 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 2009.03022 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:17, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
