Chordal graphs with bounded tree-width

TL;DR

This paper provides the first asymptotic enumeration and probabilistic analysis of labeled k-connected chordal graphs with bounded tree-width, revealing their growth rate and clique distribution as the number of vertices increases.

Contribution

It establishes the asymptotic count of k-connected chordal graphs with bounded tree-width and shows the normal distribution of clique sizes in such graphs, a novel result in this area.

Findings

Asymptotic enumeration formula for these graphs.

Clique sizes are normally distributed in large graphs.

First non-trivial class with solved enumeration for bounded tree-width.

Abstract

Given $t\geq 2$ and $0\leq k\leq t$, we prove that the number of labelled $k$-connected chordal graphs with $n$ vertices and tree-width at most $t$ is asymptotically $c n^{-5/2} \gamma^n n!$, as $n\to\infty$, for some constants $c,\gamma >0$ depending on $t$ and $k$. Additionally, we show that the number of $i$-cliques ($2\leq i\leq t$) in a uniform random $k$-connected chordal graph with tree-width at most $t$ is normally distributed as $n\to\infty$. The asymptotic enumeration of graphs of tree-width at most $t$ is wide open for $t\geq 3$. To the best of our knowledge, this is the first non-trivial class of graphs with bounded tree-width where the asymptotic counting problem is solved. Our starting point is the work of Wormald [Counting Labelled Chordal Graphs, Graphs and Combinatorics (1985)], were an algorithm is developed to obtain the exact number of labelled chordal graphs on $n$ vertices.