part A (partition systems, no class bound):
  A n=5 k=2 b=None: 60 random star-free partition systems -> verified k-colouring each time
  A n=6 k=2 b=None: 60 random star-free partition systems -> verified k-colouring each time
  A n=7 k=2 b=None: 60 random star-free partition systems -> verified k-colouring each time
  A n=8 k=2 b=None: 60 random star-free partition systems -> verified k-colouring each time
  A n=6 k=3 b=None: 60 random star-free partition systems -> verified k-colouring each time
  A n=7 k=3 b=None: 60 random star-free partition systems -> verified k-colouring each time
  A n=8 k=3 b=None: 60 random star-free partition systems -> verified k-colouring each time
  A n=7 k=4 b=None: 60 random star-free partition systems -> verified k-colouring each time
  A n=8 k=4 b=None: 60 random star-free partition systems -> verified k-colouring each time
  A n=8 k=5 b=None: 60 random star-free partition systems -> verified k-colouring each time
part A' (partition systems with class bound b, n = kb):
  A n=4 k=2 b=2: 60 random star-free partition systems -> verified k-colouring each time
  A n=6 k=3 b=2: 60 random star-free partition systems -> verified k-colouring each time
  A n=6 k=2 b=3: 60 random star-free partition systems -> verified k-colouring each time
  A n=8 k=4 b=2: 60 random star-free partition systems -> verified k-colouring each time
  A n=8 k=2 b=4: 60 random star-free partition systems -> verified k-colouring each time
part B (b-iatlon choice functions, n = kb):
  B k=2 b=2 n=kb=4: 40 random star-free 2-iatlon graphs -> verified k-colouring each time
  B k=3 b=2 n=kb=6: 40 random star-free 2-iatlon graphs -> verified k-colouring each time
  B k=2 b=3 n=kb=6: 40 random star-free 3-iatlon graphs -> verified k-colouring each time
  B k=4 b=2 n=kb=8: 40 random star-free 2-iatlon graphs -> verified k-colouring each time
  B k=3 b=3 n=kb=9: 40 random star-free 3-iatlon graphs -> verified k-colouring each time
  B k=2 b=4 n=kb=8: 40 random star-free 4-iatlon graphs -> verified k-colouring each time
  B k=5 b=2 n=kb=10: 40 random star-free 2-iatlon graphs -> verified k-colouring each time
  B k=2 b=5 n=kb=10: 40 random star-free 5-iatlon graphs -> verified k-colouring each time
