SPANNING TREES AT THE CONNECTIVITY THRESHOLD

Yahav Alon; Michael Krivelevich; Peleg Michaeli

doi:10.1137/20M1380521

SPANNING TREES AT THE CONNECTIVITY THRESHOLD

Yahav Alon, Michael Krivelevich, Peleg Michaeli

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

Abstract

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

Original language	English
Pages (from-to)	1612-1626
Number of pages	15
Journal	SIAM Journal on Discrete Mathematics
Volume	36
Issue number	3
DOIs	https://doi.org/10.1137/20M1380521
State	Published - 2022

Keywords

connectivity
random graph
spanning tree

All Science Journal Classification (ASJC) codes

General Mathematics

Access to Document

10.1137/20M1380521

Cite this

@article{cebea7e057314beebf330e0686aa4985,

title = "SPANNING TREES AT THE CONNECTIVITY THRESHOLD",

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

keywords = "connectivity, random graph, spanning tree",

author = "Yahav Alon and Michael Krivelevich and Peleg Michaeli",

note = "Publisher Copyright: {\textcopyright} 2022 Society for Industrial and Applied Mathematics.",

year = "2022",

doi = "10.1137/20M1380521",

language = "الإنجليزيّة",

volume = "36",

pages = "1612--1626",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "3",

}

TY - JOUR

T1 - SPANNING TREES AT THE CONNECTIVITY THRESHOLD

AU - Alon, Yahav

AU - Krivelevich, Michael

AU - Michaeli, Peleg

PY - 2022

Y1 - 2022

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

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

KW - connectivity

KW - random graph

KW - spanning tree

UR - http://www.scopus.com/inward/record.url?scp=85135234984&partnerID=8YFLogxK

U2 - 10.1137/20M1380521

DO - 10.1137/20M1380521

M3 - مقالة

SN - 0895-4801

VL - 36

SP - 1612

EP - 1626

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 3

ER -

SPANNING TREES AT THE CONNECTIVITY THRESHOLD

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this