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 vertices and treewidth at most (or equivalently, the number of labeled partial -trees), which we denote by . So far, only the particular cases and had been studied. We show that for and some explicit absolute constant . The upper bound is an immediate consequence of the well-known number of labeled -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 .
Paper Prompts
Sign up for free to create and run prompts on this paper.