A280020 Number of maximal triangle-free labeled graphs on n vertices.
1, 1, 3, 7, 27, 211, 1743, 15247, 219747, 5379451, 154297863, 5085738967, 225515577147, 14272681411171
Offset: 1
Examples
For n = 1 the only graph is the graph with one node and no edges. For n = 2 the only graph is the complete graph K_2. For n = 3 the maximal triangle-free graphs are isomorphic to the complete bipartite graph K_{2,1}.
Links
- József Balogh, Šárka Petříčková, The number of the maximal triangle-free graphs, Bull. London Math. Soc., 46 (2014), 1003-1006.
- F. Hüffner, tinygraph, software for generating integer sequences based on graph properties.
Extensions
a(11)-a(14) added using tinygraph by Falk Hüffner, Jul 24 2019