An analogue of the Erdős-Gallai theorem for random graphs (Q2225403): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejc.2020.103200 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJC.2020.103200 / rank | |||
Normal rank | |||
Latest revision as of 13:43, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An analogue of the Erdős-Gallai theorem for random graphs |
scientific article |
Statements
An analogue of the Erdős-Gallai theorem for random graphs (English)
0 references
8 February 2021
0 references
size-Ramsey number of paths
0 references
