Table 3. Size values to satisfy different combinatorial constraints.
n\d | 4 | 5 | 6 | 7 | 8 |
4 | 2 (1) | – | – | – | – |
5 | 3 (2) | 2 (1) | – | – | – |
6 | 5 (5) | 3 (2) | 1 (1) | – | – |
7 | 6 (5) | 5 (4) | 2 (2) | 2 (1) | – |
8 | 11 (9) | 6 (6) | 4 (4) | 2 (2) | 1 (1) |
n\d | 4 | 5 | 6 | 7 | 8 |
4 | 2 (1) | – | – | – | – |
5 | 3 (2) | 2 (1) | – | – | – |
6 | 5 (5) | 3 (2) | 1 (1) | – | – |
7 | 6 (5) | 5 (4) | 2 (2) | 2 (1) | – |
8 | 11 (9) | 6 (6) | 4 (4) | 2 (2) | 1 (1) |