On the Enumeration of Interval Graphs

preprint2016arXivOpen access

Abstract

We present upper and lower bounds for the number ini_n of interval graphs on nn vertices. Answering a question posed by Hanlon, we show that the ordinary generating function I(x)=∑n≥0in xnI(x) = \sum_{n\ge 0} i_n\,x^n for the number ini_n of nn-vertex interval graphs has radius of convergence zero. We also show that the exponential generating function J(x)=∑n≥0in xn/n!J(x) = \sum_{n\ge 0} i_n\,x^n/n! has radius of convergence at least 1/21/2.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.