arXiv math/05114222005-11math.CO

Enumeration of Unlabeled Outerplanar Graphs

Manuel Bodirsky, Eric Fusy, Mihyun Kang, Stefan Vigerske

备注：: 25 pages, 5 figures

英文摘要：

We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number g_n of unlabeled outerplanar graphs on n vertices can be computed in polynomial time, and g_n is asymptotically $g n^{-5/2}ρ^{-n}$, where $g\approx0.00909941$ and $ρ^{-1}\approx7.50360$ can be approximated. Using our enumerative results we investigate several statistical properties of random unlabeled outerplanar graphs on n vertices, for instance concerning connectedness, chromatic number, and the number of edges. To obtain the results we combine classical cycle index enumeration with recent results from analytic combinatorics.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Enumeration of labeled and unlabeled k-gonal and polygonal 2-trees and succulents by vertices

We use the theory of Γ-species to enumerate k-gonal and polygonal 2-trees with respect to their vertices. We then extend this result to enumerate "succulents", a tree-like class of graphs which generalize cacti.

2013-09-17math.CO

Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs

Let $Δ=\{ δ_1,δ_2,...,δ_m \} $ be a finite set of 2-connected patterns, i.e. graphs up to vertex relabelling. We study the generating function $D_{Δ}(z,u_1,u_2,...,u_m),$ which counts polygon dissections and marks subgraph copies of $δ_i$ with the variable $u_i$. We prove that this is always algebraic, through an explicit combinatorial decomposition depending on $Δ$. The decomposition also gives a defining system for $D_{Δ}(z,\mathbf{0})$, which encodes polygon dissections that restrict these patterns as subgraphs. In this way, we are able to extract normal limit laws for the patterns when the…

2018-08-28math.CO

Enumeration and limit laws of series-parallel graphs

We show that the number $g_n$ of labelled series-parallel graphs on $n$ vertices is asymptotically $g_n \sim g\cdot n^{-5/2} γ^n n!$, where $γ$ and $g$ are explicit computable constants. We show that the number of edges in random series-parallel graphs is asymptotically normal with linear mean and variance, and that the number of edges is sharply concentrated around its expected value. Similar results are proved for labelled outerplanar graphs and for graphs not containing $K_{2,3}$ as a minor.

2005-12-19math.CO

Toward an enumeration of unlabeled trees

We present an algorithm that, on input $n$, lists every unlabeled tree of order $n$.

2017-03-11cs.DSmath.CO

Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration

Given graphs $G$ and $H$, we propose a method to implicitly enumerate topological-minor-embeddings of $H$ in $G$ using decision diagrams. We show a useful application of our method to enumerating subgraphs characterized by forbidden topological minors, that is, planar, outerplanar, series-parallel, and cactus subgraphs. Computational experiments show that our method can find all planar subgraphs in a given graph at most five orders of magnitude faster than a naive backtracking-based method.

2019-11-18cs.DSmath.CO

Schröder Coloring and Applications

We present several bijections, in terms of combinatorial objects counted by the Schröder numbers, that are then used (via coloring) for the construction and enumeration of rational Schröder paths with integer slope, ordered rooted trees, and simple rooted outerplanar maps. On the other hand, we derive partial Bell polynomial identities for the little and large Schröder numbers, which allow us to obtain explicit enumeration formulas.

2019-08-21math.CO

更多相关论文收起更多论文

On Cayley's Enumeration of Alkanes (or 4-Valent Trees)

Cayley's 1875 enumerations of centered and bicentered alkanes (unlabeled trees of valency at most 4) are corrected and extended -- possibly for the first time in 124 years.

2002-07-20math.CO

Enumeration of bipartite graphs and bipartite blocks

Using the theory of combinatorial species, we compute the cycle index for bipartite graphs, which we use to count unlabeled bipartite graphs and bipartite blocks.

2014-03-29math.CO

Γ-species, quotients, and graph enumeration

The theory of Γ-species is developed to allow species-theoretic study of quotient structures in a categorically rigorous fashion. This new approach is then applied to two graph-enumeration problems which were previously unsolved in the unlabeled case-bipartite blocks and general k-trees.

2012-04-06math.CO

Enumeration and Random Generation of Unlabeled Classes of Graphs: A Practical Study of Cycle Pointing and the Dissymmetry Theorem

Our work studies the enumeration and random generation of unlabeled combinatorial classes of unrooted graphs. While the technique of vertex pointing provides a straightforward procedure for analyzing a labeled class of unrooted graphs by first studying its rooted counterpart, the existence of nontrivial symmetries in the unlabeled case causes this technique to break down. Instead, techniques such as the dissymmetry theorem (of Otter) and cycle pointing (of Bodirsky et al.) have emerged in the unlabeled case, with the former providing an enumeration of the class and the latter providing both an…

2015-11-19cs.DMcs.DSmath.CO

有根二叉完美系统发育树的计数

Enumeration of rooted binary perfect phylogenies

本文研究了有根二叉完美系统发育树的计数问题，通过将大小为s的谱系样本分布到n个叶子的无标签树上，推广了有根二叉无标签树并刻画了其组合结构。

2024-10-19math.COq-bio.PE

Combinatorial species and graph enumeration

In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the distinction between labeled and unlabeled structures. The cycle index series of a species encodes the labeled and unlabeled enumerative data of that species. Moreover, by using species operations, we are able to solve for the cycle index series of one species in terms of other, known cycle indices of other species. Section 3 is an exposition of species theory and Sect…

2013-12-02math.CO

Γ-species and the enumeration of k-trees

We study the class of graphs known as k-trees through the lens of Joyal's theory of combinatorial species (and an equivariant extension known as '$Γ$-species' which incorporates data about 'structural' group actions). This culminates in a system of recursive functional equations giving the generating function for unlabeled k-trees which allows for fast, efficient computation of their numbers. Enumerations up to k = 10 and n = 30 (for a k-tree with (n+k-1) vertices) are included in tables, and Sage code for the general computation is included in an appendix.

2012-12-12math.CO

多重部分类reduced树的计数

Enumeration of multipartite series-reduced trees

本文研究了多重部分类reduced树的计数问题，提出了生成函数方法，并确定了符号超度量和链递增二叉树的数量关系，同时改进了Riordan和Shannon的结果。

2025-12-19math.CO

Boltzmann Samplers, Pólya Theory, and Cycle Pointing

We introduce a general method to count unlabeled combinatorial structures and to efficiently generate them at random. The approach is based on pointing unlabeled structures in an "unbiased" way that a structure of size n gives rise to n pointed structures. We extend Polya theory to the corresponding pointing operator, and present a random sampling framework based on both the principles of Boltzmann sampling and on Pólya operators. All previously known unlabeled construction principles for Boltzmann samplers are special cases of our new results. Our method is illustrated on several examples: in…

2011-03-26cs.DMmath.CO

Asymptotic study of subcritical graph classes

We present a unified general method for the asymptotic study of graphs from the so-called "subcritical"$ $ graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works both in the labelled and unlabelled framework. The main results concern the asymptotic enumeration and the limit laws of properties of random graphs chosen from subcritical classes. We show that the number $g_n/n!$ (resp. $g_n$) of labelled (resp. unlabelled) graphs on $n$ vertices from a subcritical graph class ${G}=\cup_n {G_n}$ satisfies asymptotically the…

2019-02-11math.CO

见树亦见林：论无标号森林的无限可分性

To see the forest for the trees: On the infinite divisibility of unlabeled forests

本文用Lévy过程与概率极限理论重新证明并推广无标号森林计数中Palmer-Schwenk等经典结果，揭示随机森林树数收敛于平移复合泊松分布。

2025-07-22math.COmath.PR

Kolmogorov Random Graphs and the Incompressibility Method

We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance of the number of (possibly overlapping) ordered labeled subgraphs of a labeled graph as a function of its randomness deficiency (how far it falls short of the maximum possible Kolmogorov complexity) and (ii) a new elementary proof for the number of unlabeled graphs.

2001-10-18math.CO

Regular Bipartite Graphs And Their Properties

We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all non-isomorphic 2-regular bipartite graphs for a specified number of vertices has been described and a mathematical proof has been provided for its completeness. An abstraction of m Symmetric Permutation Tree in order to visualize a labeled r-Regular Bipartite Graph with 2m vertices and enumerate its automorphism group has been introduced. An algorithm to ge…

2015-12-29cs.DMmath.CO

通过等变蒸发计算无标签弦图的数量

Counting Unlabeled Chordal Graphs by Equivariant Evaporation

通过Polya-Burnside枚举法计算n个顶点的无标签弦图总数及连通图数量，扩展已有的序列。核心是给出计算π不变的有标签弦图数量的动态规划，证明相关分解和递归正确性，算法时间复杂度为n^{O(√n)}，并报告新结果及验证。

2026-07-07cs.DMmath.CO

Testing correlation of unlabeled random graphs

We study the problem of detecting the edge correlation between two random graphs with $n$ unlabeled nodes. This is formalized as a hypothesis testing problem, where under the null hypothesis, the two graphs are independently generated; under the alternative, the two graphs are edge-correlated under some latent node correspondence, but have the same marginal distributions as the null. For both Gaussian-weighted complete graphs and dense Erdős-Rényi graphs (with edge probability $n^{-o(1)}$), we determine the sharp threshold at which the optimal testing error probability exhibits a phase transit…

2021-02-08math.COmath.PRmath.ST