Number of triangle-free graphs g on n nodes for which the chromatic number chi(g) equals r(g) = ceiling((Delta(g) + 1 + omega(g))/2).
A119414
Number of triangle-free graphs g on n nodes for which the chromatic number chi(g) equals r(g) = ceiling((Delta(g) + 1 + omega(g))/2).
Terms
- a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =0a(6) =0a(7) =0a(8) =0a(9) =0a(10) =1a(11) =21a(12) =826a(13) =39889
External references
- oeis: A119414