An analogue of the Erdős-Gallai theorem for random graphs (Q2225403): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W3080426545 / rank
 
Normal rank

Revision as of 19:19, 19 March 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
    0 references
    0 references
    0 references
    8 February 2021
    0 references
    size-Ramsey number of paths
    0 references

    Identifiers