Subgraph statistics in subcritical graph classes
From MaRDI portal
Publication:4597604
DOI10.1002/rsa.20721zbMath1379.05100arXiv1512.08889OpenAlexW3102103241MaRDI QIDQ4597604
Juanjo Rué, Lander Ramos, Michael Drmota
Publication date: 13 December 2017
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.08889
generating functionsrandom graphsseries-parallel graphsanalytic combinatoricssubcritical graph classes
Related Items (11)
Asymptotic properties of random unlabelled block-weighted graphs ⋮ Threshold functions for small subgraphs in simple graphs and multigraphs ⋮ Threshold functions for small subgraphs: an analytic approach ⋮ Limits of random tree-like discrete structures ⋮ Maximal independent sets and maximal matchings in series-parallel and related graph classes ⋮ Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs ⋮ Subcritical Graph Classes Containing All Planar Graphs ⋮ On general subtrees of a conditioned Galton-Watson tree ⋮ Counting embeddings of rooted trees into families of rooted trees ⋮ Enumeration of chordal planar graphs and maps ⋮ Enumeration of rooted 3-connected bipartite planar maps
This page was built for publication: Subgraph statistics in subcritical graph classes