An Erdős-Gallai type theorem for uniform hypergraphs (Q1686258): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2766481075 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1608.03241 / rank | |||
Normal 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 | |||
Latest revision as of 21:00, 14 July 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
