Abstract
Let P(n,m) be a graph chosen uniformly at random from the class of all planar graphs on vertex set [n]:={1,…,n} with m=m(n) edges. We show that in the sparse regime, when m/n≤1, with high probability the maximum degree of P(n,m) takes at most two different values. In contrast, this is not true anymore in the dense regime, when m/n>1, where the maximum degree of P(n,m) is not concentrated on any subset of [n] with bounded size.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
