Mathematics > Number Theory
[Submitted on 28 May 2018 (v1), last revised 18 Feb 2021 (this version, v4)]
Title:Sieve Methods in Random Graph Theory
View PDFAbstract:In this paper, we apply the Turan sieve and the simple sieve developed by R. Murty and the first author to study problems in random graph theory. In particular, we obtain upper and lower bounds on the probability of a graph on n vertices having diameter 2 (or diameter 3 in the case of bipartite graphs) with edge probability p(n) where the edges are chosen independently . An interesting feature revealed in these results is that the Turan sieve and the simple sieve `almost completely' complement each other. As a corollary to our result, we note that the probability of a random graph having diameter 2 approaches 1 as n approaches infinity for constant edge probability p(n)=1/2. This is an appendix of a shorter version of this paper.
Submission history
From: John Saunders [view email][v1] Mon, 28 May 2018 19:56:01 UTC (9 KB)
[v2] Wed, 6 Mar 2019 12:06:24 UTC (12 KB)
[v3] Wed, 10 Feb 2021 05:27:27 UTC (35 KB)
[v4] Thu, 18 Feb 2021 22:08:09 UTC (35 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.