[K13 x K13] d=2 |V|=16 polytopes=121 (= prod of #subtrees [11, 11]) polytope-graph edges=330: (L1),(L2) OK
   (L3) TP == 2*sigma on 4952 triples (exhaustive |F|<=1 + 600 random 2<=|F|<=5): OK; TS bound, TP<=2TS, (i) OK; max (TS+N)^a/(TP+N) = 1.000 (proof allows 33)
[spider(2,2,1) x P3] d=2 |V|=18 polytopes=150 (= prod of #subtrees [25, 6]) polytope-graph edges=402: (L1),(L2) OK
   (L3) TP == 2*sigma on 6756 triples (exhaustive |F|<=1 + 600 random 2<=|F|<=5): OK; TS bound, TP<=2TS, (i) OK; max (TS+N)^a/(TP+N) = 1.000 (proof allows 33)
[K13 x P2 x P2] d=3 |V|=16 polytopes=99 (= prod of #subtrees [11, 3, 3]) polytope-graph edges=267: (L1),(L2) OK
   (L3) TP == 2*sigma on 4952 triples (exhaustive |F|<=1 + 600 random 2<=|F|<=5): OK; TS bound, TP<=2TS, (i) OK; max (TS+N)^a/(TP+N) = 1.000 (proof allows 77)
[bintree7 x P3] d=2 |V|=21 polytopes=222 (= prod of #subtrees [37, 6]) polytope-graph edges=642: (L1),(L2) OK
   (L3) TP == 2*sigma on 400 triples (400 random 2<=|F|<=5): OK; TS bound, TP<=2TS, (i) OK; max (TS+N)^a/(TP+N) = 0.457 (proof allows 33)
[rtree7 x rtree5] d=2 |V|=35 polytopes=510 (= prod of #subtrees [34, 15]) polytope-graph edges=1580: (L1),(L2) OK
   (L3) TP == 2*sigma on 400 triples (400 random 2<=|F|<=5): OK; TS bound, TP<=2TS, (i) OK; max (TS+N)^a/(TP+N) = 0.500 (proof allows 33)
[P3 x P3 x P3] d=3 |V|=27 polytopes=216 (= prod of #subtrees [6, 6, 6]) polytope-graph edges=648: (L1),(L2) OK
   (L3) TP == 2*sigma on 300 triples (300 random 2<=|F|<=4): OK; TS bound, TP<=2TS, (i) OK; max (TS+N)^a/(TP+N) = 0.488 (proof allows 77)
[Young diagram (5,4,4,2,1) in Z^2] median graph, |V|=16, polytopes=115, hyperplanes=8: (M) TP == 2*hyp on 300 random triples: OK
[3-cube + square on an edge + pendant P3] median graph, |V|=12, polytopes=65, hyperplanes=6: (M) TP == 2*hyp on 300 random triples: OK
[tree of three squares + pendant] median graph, |V|=11, polytopes=75, hyperplanes=7: (M) TP == 2*hyp on 300 random triples: OK
ALL CHECKS PASSED
