Random graphs on surfaces
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1421319
- The evolution of random graphs on surfaces
- The Evolution of Random Graphs on Surfaces
- Random regular graphs and the systole of a random surface
- Publication:4865687
- Random \(k\)-surfaces
- Random planar graphs and beyond
- Graphs on surfaces
- scientific article; zbMATH DE number 5016711
- Random planar graphs
Cites work
- scientific article; zbMATH DE number 5130821 (Why is no real title available?)
- scientific article; zbMATH DE number 1146225 (Why is no real title available?)
- scientific article; zbMATH DE number 2038777 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 5050599 (Why is no real title available?)
- 0-1 laws for maps
- A pattern for the asymptotic number of rooted maps on surfaces
- Almost all maps are asymmetric
- Almost all rooted maps have large representativity
- Asymptotic normality determined by high moments, and submap counts of random maps
- Blocks and the nonorientable genus of graphs
- Coefficients of functional compositions often grow smoothly
- Generating Outerplanar Graphs Uniformly at Random
- Graphs on surfaces
- On random planar graphs, the number of planar graphs and their triangulations
- On the Maximum Degree of a Random Planar Graph
- On the Number of Edges in Random Planar Graphs
- On the independence ratio of a graph
- On the number of series parallel and outerplanar graphs
- Planar graphs, via well-orderly maps and trees
- Proper minor-closed families are small
- Random cubic planar graphs
- Random planar graphs
- Random planar graphs with \(n\) nodes and a fixed number of edges
- Random planar graphs with given average degree
- Separating and nonseparating disjoint homotopic cycles in graph embeddings
- Submap Density and Asymmetry Results for Two Parameter Map Families
- Submaps of maps. I: General 0-1 laws
- The asymptotic number of rooted maps on a surface
- The asymptotic number of rooted maps on a surface. II: Enumeration by vertices and faces
- The asymptotic number of rooted nonseparable maps on a surface
- The number of labeled 2-connected planar graphs
Cited in
(26)- Random graphs from a minor-closed class
- The evolution of random graphs on surfaces of non-constant genus
- Weakly distinguishing graph polynomials on addable properties
- Pendant appearances and components in random graphs from structured classes
- On graphs with few disjoint \(t\)-star minors
- Longest and shortest cycles in random planar graphs
- Random graphs embeddable in order-dependent surfaces
- Random maps
- The Evolution of Random Graphs on Surfaces
- Degree distribution in random planar graphs
- Phase transitions in graphs on orientable surfaces
- Unlabelled Gibbs partitions
- Random graphs from a weighted minor-closed class
- The evolution of random graphs on surfaces
- On some putative graph-theoretic counterexamples to the principle of the identity of indiscernibles
- Growth constants of minor-closed classes of graphs
- Random graphs containing few disjoint excluded minors
- Logical limit laws for minor-closed classes of graphs
- Asymptotic enumeration and limit laws for graphs of fixed genus
- Graph classes with given 3-connected components: asymptotic enumeration and random graphs
- Two critical periods in the evolution of random planar graphs
- Classes of graphs embeddable in order-dependent surfaces
- Concentration of maximum degree in random planar graphs
- Local convergence of random planar graphs
- Unprovability threshold for the planar graph minor theorem
- Counting planar graphs and related families of graphs
This page was built for publication: Random graphs on surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q933680)
