pith. sign in

arxiv: 1810.02040 · v1 · pith:WUTFZDL2new · submitted 2018-10-04 · 🧮 math.CO

Counting unlabeled interval graphs

classification 🧮 math.CO
keywords graphsintervalboundscountingdenotingimproveinftynumber
0
0 comments X
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.