Random graphs embeddable in order-dependent surfaces
From MaRDI portal
Publication:6375437
DOI10.1002/RSA.21199arXiv2108.07666MaRDI QIDQ6375437FDOQ6375437
Authors: Colin McDiarmid, Sophia Saller
Publication date: 17 August 2021
Abstract: Given a `genus' function , we let be the class of all graphs such that if has order (that is, has vertices) then it is embeddable in a surface of Euler genus at most . Let the random graph be sampled uniformly from the graphs in on vertex set . Observe that if is 0 then is a random planar graph, and if is sufficiently large then is a binomial random graph . We investigate typical properties of . We find that for emph{every} genus function , with high probability at most one component of is non-planar. In contrast, we find a transition for example for connectivity: if is non-decreasing and then , and if then with high probability is connected. These results also hold when we consider orientable and non-orientable surfaces separately. We also investigate random graphs sampled uniformly from the `hereditary part' or the `minor-closed' part of , and briefly consider corresponding results for unlabelled graphs.
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (1)
This page was built for publication: Random graphs embeddable in order-dependent surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6375437)