Counting unlabeled interval graphs
classification
🧮 math.CO
keywords
graphsintervalboundscountingdenotingimproveinftynumber
read the original abstract
We improve the bounds on the number of interval graphs on $n$ vertices. In particular, denoting by $I_n$ the quantity in question, we show that $\log I_n \sim n\log n$ as $n\to \infty$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.