Adding random edges to dense graphs
Combinatorics
2016-05-25 v1
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 -connectivity.
Cite
@article{arxiv.1605.07237,
title = {Adding random edges to dense graphs},
author = {Tom Bohman and Alan Frieze and Michael Krivelevich and Ryan R. Martin},
journal= {arXiv preprint arXiv:1605.07237},
year = {2016}
}
Comments
14 pages