Adding random edges to dense graphs
classification
🧮 math.CO
keywords
edgesrandomdensegraphsaddingadditionappearancearbitrary
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.