@standupmaths There's an error in your latest video https://youtu.be/TNWl-0rle4A. Graph A's 3 node joins with graph B's 2 and 6 nodes. You can change node 3's label to 5 then there are no joins between graph A and B. Then smallest valid n is 25.