arXiv:2108.07051 Abstract | arXiv Analytics

arXiv:2108.07051 [math.CO]Abstract References Reviews Resources

Pendant appearances and components in random graphs from structured classes

Published 2021-08-16Version 1

We consider random graphs sampled uniformly from a structured class of graphs, such as the class of graphs embeddable in a given surface. We sharpen and extend earlier results on pendant appearances, concerning for example numbers of leaves; and obtain results on the asymptotic distribution of components other than the giant component, under quite general conditions.

Comments: 29 pages

Categories: math.CO

Subjects: 05C80

Keywords: random graphs, pendant appearances, structured class, extend earlier results, giant component

Related articles: Most relevant | Search more

arXiv:1310.7652 [math.CO] (Published 2013-10-29, updated 2015-04-01)

Connectivity and Giant Component of Stochastic Kronecker Graphs

Mary Radcliffe, Stephen J. Young

arXiv:1312.4096 [math.CO] (Published 2013-12-15)

A Simple Proof of the Cayley Formula using Random Graphs

Scott Wu, Ray Li, Andrew He, Steven Hao

arXiv:2202.09917 [math.CO] (Published 2022-02-20, updated 2022-09-13)