An analogue of the Erdős-Gallai theorem for random graphs (Q2225403)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An analogue of the Erdős-Gallai theorem for random graphs |
scientific article; zbMATH DE number 7307237
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An analogue of the Erdős-Gallai theorem for random graphs |
scientific article; zbMATH DE number 7307237 |
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
0.8115801215171814
0 references
0.7855339050292969
0 references
0.7842721939086914
0 references
0.7767989039421082
0 references
0.7741649746894836
0 references
