Number of triangle-free graphs g on n nodes for which the chromatic number chi(g) equals r(g)=ceil((Delta(g)+1+omega(g))/2).
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 21, 826, 3988
1 seqfan posts
Sat May 2 16:12:32 CEST 2009 [seqfan] Re: OEIS duplicate hunt