On the maximum number of edges in a hypergraph whose linegraph contains no cycle (Q1143416): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3941433 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4180389 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(80)90237-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2070905991 / rank | |||
Normal rank | |||
Latest revision as of 09:17, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the maximum number of edges in a hypergraph whose linegraph contains no cycle |
scientific article |
Statements
On the maximum number of edges in a hypergraph whose linegraph contains no cycle (English)
0 references
1980
0 references
uniform hypergraph
0 references
almost Steiner systems
0 references
line graph of a hypergraph
0 references
