SPANNING TREES AT THE CONNECTIVITY THRESHOLD

Yahav Alon, Michael Krivelevich, Peleg Michaeli

Research output: Contribution to journalArticlepeer-review

Abstract

We present an explicit connected spanning structure that appears in a random graph just above the connectivity threshold with high probability.

Original languageEnglish
Pages (from-to)1612-1626
Number of pages15
JournalSIAM Journal on Discrete Mathematics
Volume36
Issue number3
DOIs
StatePublished - 2022

Funding

FundersFunder number
USA-Israel BSF2018267
Horizon 2020 Framework Programme676970
European Research Council1207/15
Israel Science Foundation1261/17

    Keywords

    • connectivity
    • random graph
    • spanning tree

    Fingerprint

    Dive into the research topics of 'SPANNING TREES AT THE CONNECTIVITY THRESHOLD'. Together they form a unique fingerprint.

    Cite this