RUS  ENG
Full version
JOURNALS // Itogi Nauki i Tekhniki. Sovremennaya Matematika i ee Prilozheniya. Tematicheskie Obzory // Archive

Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 2020 Volume 177, Pages 132–136 (Mi into607)

This article is cited in 4 papers

Enumeration of labeled series-parallel tricyclic graphs

V. A. Voblyi

All-Russian Institute for Scientific and Technical Information of Russian Academy of Sciences, Moscow

Abstract: A series-parallel graph is a graph that does not contain a complete graph with four vertices as a minor. An explicit formula for the number of labeled series-parallel tricyclic graphs with a given number of vertices is obtained, and the corresponding asymptotics for the number of such graphs with a large number of vertices is found. We prove that under a uniform probability distribution, the probability that the labeled tricyclic graph is a series-parallel graph is asymptotically equal to $13/15$.

Keywords: enumeration, labeled graph, series-parallel graph, asymptotics, probability.

UDC: 519.175.3

MSC: 05C30

DOI: 10.36535/0233-6723-2020-177-132-136



© Steklov Math. Inst. of RAS, 2025