On the enumeration of interval graphs

Abstract: We present upper and lower bounds for the number

i_{n}

of interval graphs on

n

vertices. Answering a question posed by Hanlon, we show that the ordinary generating function

I (x) = s u m_{n g e 0} i_{n}, x^{n}

for the number

i_{n}

of

n

-vertex interval graphs has radius of convergence zero. We also show that the exponential generating function

J (x) = s u m_{n g e 0} i_{n}, x^{n} / n!

has radius of convergence at least

1 / 2

.

Recommendations

Cites work

Cited in

(13)

Describes a project that uses

Uses Software

This page was built for publication: On the enumeration of interval graphs