Adding random edges to dense graphs

Tom Bohman; Alan Frieze; Michael Krivelevich; Ryan Martin

doi:10.1002/rsa.10112

Adding random edges to dense graphs

Tom Bohman^*
, Alan Frieze
, Michael Krivelevich
, Ryan Martin

^*Corresponding author for this work

School of Mathematical Sciences

Carnegie Mellon University

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

42 Scopus citations

Abstract

This paper investigates the addition of random edges to arbitrary dense graphs; in particular, we determine the number of random edges required to ensure various monotone properties including the appearance of a fixed size clique, small diameter and k-connectivity.

Original language	English
Pages (from-to)	105-117
Number of pages	13
Journal	Random Structures and Algorithms
Volume	24
Issue number	2
DOIs	https://doi.org/10.1002/rsa.10112
State	Published - Mar 2004

Funding

Funders	Funder number
National Science Foundation	0100400, 9818411, 9819950

Access to Document

10.1002/rsa.10112

Cite this

@article{a8266ceb99b045018d6b77e826df3d1b,

title = "Adding random edges to dense graphs",

abstract = "This paper investigates the addition of random edges to arbitrary dense graphs; in particular, we determine the number of random edges required to ensure various monotone properties including the appearance of a fixed size clique, small diameter and k-connectivity.",

author = "Tom Bohman and Alan Frieze and Michael Krivelevich and Ryan Martin",

year = "2004",

month = mar,

doi = "10.1002/rsa.10112",

language = "אנגלית",

volume = "24",

pages = "105--117",

journal = "Random Structures and Algorithms",

issn = "1042-9832",

publisher = "John Wiley and Sons Ltd",

number = "2",

}

TY - JOUR

T1 - Adding random edges to dense graphs

AU - Bohman, Tom

AU - Frieze, Alan

AU - Krivelevich, Michael

AU - Martin, Ryan

PY - 2004/3

Y1 - 2004/3

N2 - This paper investigates the addition of random edges to arbitrary dense graphs; in particular, we determine the number of random edges required to ensure various monotone properties including the appearance of a fixed size clique, small diameter and k-connectivity.

AB - This paper investigates the addition of random edges to arbitrary dense graphs; in particular, we determine the number of random edges required to ensure various monotone properties including the appearance of a fixed size clique, small diameter and k-connectivity.

UR - https://www.scopus.com/pages/publications/2542615973

U2 - 10.1002/rsa.10112

DO - 10.1002/rsa.10112

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:2542615973

SN - 1042-9832

VL - 24

SP - 105

EP - 117

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 2

ER -

Adding random edges to dense graphs

Abstract

Funding

Access to Document

Other files and links

Fingerprint

Cite this