

A345247


Number of unlabeled graphs of odd girth at least 7 with n vertices.


1



1, 2, 3, 7, 13, 35, 89, 306, 1141, 5615, 33397, 260624, 2623475, 35100394, 627244166, 15122214205, 493568138475
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

The odd girth of a graph is the length of a shortest cycle of odd length. Thus, these are the graphs (not necessarily connected) that do not have a triangle or C_5 as a subgraph. The bipartite graphs (which have no odd cycles) are included.


LINKS



CROSSREFS



KEYWORD

nonn,hard,more


AUTHOR



STATUS

approved



