Papers
Topics
Authors
Recent
Search
2000 character limit reached

The number of labeled graphs of bounded treewidth

Published 25 Apr 2016 in math.CO, cs.DM, and cs.DS | (1604.07273v1)

Abstract: We focus on counting the number of labeled graphs on nn vertices and treewidth at most kk (or equivalently, the number of labeled partial kk-trees), which we denote by Tn,kT_{n,k}. So far, only the particular cases Tn,1T_{n,1} and Tn,2T_{n,2} had been studied. We show that (c⋅k⋅2k⋅nlog⁡k)n⋅2−k(k+3)2⋅k−2k−2 ≤ Tn,k ≤ (k⋅2k⋅n)n⋅2−k(k+1)2⋅k−k, \left(c \cdot \frac{k\cdot 2^k \cdot n}{\log k} \right)^n \cdot 2^{-\frac{k(k+3)}{2}} \cdot k^{-2k-2}\ \leq\ T_{n,k}\ \leq\ \left(k \cdot 2^k \cdot n\right)^n \cdot 2^{-\frac{k(k+1)}{2}} \cdot k^{-k}, for k>1k > 1 and some explicit absolute constant c>0c > 0. The upper bound is an immediate consequence of the well-known number of labeled kk-trees, while the lower bound is obtained from an explicit algorithmic construction. It follows from this construction that both bounds also apply to graphs of pathwidth and proper-pathwidth at most kk.

Authors (3)
Citations (8)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.