English

On the Enumeration of Interval Graphs

Combinatorics 2016-09-09 v1

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)=n0inxnI(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)=n0inxn/n!J(x) = \sum_{n\ge 0} i_n\,x^n/n! has radius of convergence at least 1/21/2.

Keywords

Cite

@article{arxiv.1609.02479,
  title  = {On the Enumeration of Interval Graphs},
  author = {Joyce C. Yang and Nicholas Pippenger},
  journal= {arXiv preprint arXiv:1609.02479},
  year   = {2016}
}

Comments

i+3 pp

R2 v1 2026-06-22T15:44:07.112Z