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

From MaRDI portal
Revision as of 19:19, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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