login
A078564
Number of (simple, undirected, unlabeled, connected) graphs with n vertices which contain no induced subgraph isomorphic to the complement of P5 (the "house" graph).
1
1, 1, 2, 6, 20, 93, 515, 3701, 32714, 359289, 4847830, 80064871, 1607606989, 38983675574
OFFSET
1,3
COMMENTS
Also, number of (simple, undirected, unlabeled, connected) graphs with n vertices which contain no induced subgraph isomorphic to a P5 (the path on 5 vertices). - Falk Hüffner, Nov 27 2015
LINKS
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong, Obstructions for three-coloring graphs without induced paths on six vertices, arXiv preprint arXiv:1504.06979 [math.CO], 2015.
F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version 8489dde.
CROSSREFS
Sequence in context: A104985 A210690 A079575 * A079576 A079570 A131842
KEYWORD
more,nonn
AUTHOR
Jim Nastos, Jan 07 2003
EXTENSIONS
Corrected by Jim Nastos, Jan 20 2003
a(10)..a(14) from Falk Hüffner, Jan 13 2016
STATUS
approved