An Erdős-Gallai type theorem for uniform hypergraphs (Q1686258): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejc.2017.10.006 / rank | |||
| Property / cites work | |||
| Property / cites work: On maximal paths and circuits of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hypergraph extensions of the Erdős-Gallai theorem / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJC.2017.10.006 / rank | |||
Normal rank | |||
Latest revision as of 04:38, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Erdős-Gallai type theorem for uniform hypergraphs |
scientific article |
Statements
An Erdős-Gallai type theorem for uniform hypergraphs (English)
0 references
21 December 2017
0 references
maximum number of hyperedges
0 references
\(r\)-uniform hypergraph
0 references
