Maximal order of a triangle-free cyclic graph with no independent set of size n.
A000789
Maximal order of a triangle-free cyclic graph with no independent set of size n.
Terms
- a(0) =2a(1) =5a(2) =8a(3) =13a(4) =16a(5) =21a(6) =26a(7) =35a(8) =38a(9) =45a(10) =48
External references
- oeis: A000789