Simple hypergraphs with maximal number of adjacent pairs of edges (Q1142787): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2094590317 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graphs with maximal number of adjacent pairs of edges / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4196436 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4052170 / rank | |||
Normal rank | |||
Latest revision as of 04:44, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simple hypergraphs with maximal number of adjacent pairs of edges |
scientific article |
Statements
Simple hypergraphs with maximal number of adjacent pairs of edges (English)
0 references
1980
0 references
hypergraph
0 references
adjacent pairs of edges
0 references
