Explore related knowledge and questions →

Question 26038: Minimum Vertex Covers Are Selected Only after Complete Subset Coverage Audits

On this page
  1. Original question and givens
  2. Definition and scope
  3. Step-by-step derivation
  4. Reverse checks
  5. Result
  6. This question review and source binding

Return to catalogue page 131

← Question derivation index · Original question batch

R0051-26038 · q-20261015-advance-20261115-r06-minimum-vertex-cover-0013

Original question and givens

Use complete unique vertices=[v0, v1, v2, v3, v4, v5, v6] and loop-free duplicate-free undirected edges=[[v0, v1], [v1, v2], [v2, v3], [v3, v4], [v4, v5], [v5, v6], [v6, v0]]. An edge needs at least one selected endpoint. Preserve source canonical subset order. Give (vertices, edges, all_covers, minimum_size, minimum_covers, certificate).

  • G001 — Use complete unique vertices=[v0, v1, v2, v3, v4, v5, v6] and loop-free duplicate-free undirected edges=[[v0, v1], [v1, v2], [v2, v3], [v3, v4], [v4, v5], [v5, v6], [v6, v0]]. An edge needs at least one selected endpoint. Preserve source canonical subset order. Give (vertices, edges, all_covers, minimum_size, minimum_covers, certificate).

Definition and scope

Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate.

Step-by-step derivation

S001 · implies

Before

source roles = [mincover-exhaustive-minimizers]

After

derived = [[vertices, edges, all_covers, minimum_size, minimum_covers, certificate]]

Conditions: none

List the full source field order without JavaScript.Original modes select contract6/4/6/6 and IVT8/7/8 roles,without padding or answer-shape inference.

Step identifiers and dependencies

Rule: source_ordered_fields_without_JS · Uses: G001

S002 · implies

Before

source roles = [[v0, v1, v2, v3, v4, v5, v6], [[v0, v1], [v1, v2], [v2, v3], [v3, v4], [v4, v5], [v5, v6], [v6, v0]], null]

After

derived = [[v0, v1, v2, v3, v4, v5, v6], [[v0, v1], [v0, v6], [v1, v2], [v2, v3], [v3, v4], [v4, v5], [v5, v6]], null]

Conditions: none

The carrier is nonempty with at most12 vertices;sort endpoints by UTF16 then edge families in English.Reject loops/reversed duplicates.An omitted candidate stays null,not an invented empty candidate.

Step identifiers and dependencies

Rule: Mincover_complete_simple_graph_UTF16_English_and_optional_candidate · Uses: G001, S001

S003 · implies

Before

source roles = [[v0, v1, v2, v3, v4, v5, v6], [[v0, v1], [v0, v6], [v1, v2], [v2, v3], [v3, v4], [v4, v5], [v5, v6]], 128]

After

derived = [[43, 45, 47, 53, 55, 59, 61, 63, 85, 86, 87, 90, 91, 93, 94, 95, 106, 107, 109, 110, 111, 117, 118, 119, 122, 123, 125, 126, 127], [[0, 0], [1, 2], [2, 1], [3, 3], [4, 0], [5, 4], [6, 1], [7, 4], [8, 0], [9, 2], [10, 1], [11, 5], [12, 0], [13, 5], [14, 1], [15, 5], [16, 0], [17, 2], [18, 1], [19, 3], [20, 0], [21, 6], [22, 1], [23, 6], [24, 0], [25, 2], [26, 1], [27, 6], [28, 0], [29, 6], [30, 1], [31, 6], [32, 0], [33, 2], [34, 1], [35, 3], [36, 0], [37, 4], [38, 1], [39, 4], [40, 0], [41, 2], [42, 1], [44, 0], [46, 1], [48, 0], [49, 2], [50, 1], [51, 3], [52, 0], [54, 1], [56, 0], [57, 2], [58, 1], [60, 0], [62, 1], [64, 0], [65, 2], [66, 3], [67, 3], [68, 0], [69, 4], [70, 4], [71, 4], [72, 0], [73, 2], [74, 5], [75, 5], [76, 0], [77, 5], [78, 5], [79, 5], [80, 0], [81, 2], [82, 3], [83, 3], [84, 0], [88, 0], [89, 2], [92, 0], [96, 0], [97, 2], [98, 3], [99, 3], [100, 0], [101, 4], [102, 4], [103, 4], [104, 0], [105, 2], [108, 0], [112, 0], [113, 2], [114, 3], [115, 3], [116, 0], [120, 0], [121, 2], [124, 0]], [[v0, v1, v3, v5], [v0, v2, v3, v5], [v0, v1, v2, v3, v5], [v0, v2, v4, v5], [v0, v1, v2, v4, v5], [v0, v1, v3, v4, v5], [v0, v2, v3, v4, v5], [v0, v1, v2, v3, v4, v5], [v0, v2, v4, v6], [v1, v2, v4, v6], [v0, v1, v2, v4, v6], [v1, v3, v4, v6], [v0, v1, v3, v4, v6], [v0, v2, v3, v4, v6], [v1, v2, v3, v4, v6], [v0, v1, v2, v3, v4, v6], [v1, v3, v5, v6], [v0, v1, v3, v5, v6], [v0, v2, v3, v5, v6], [v1, v2, v3, v5, v6], [v0, v1, v2, v3, v5, v6], [v0, v2, v4, v5, v6], [v1, v2, v4, v5, v6], [v0, v1, v2, v4, v5, v6], [v1, v3, v4, v5, v6], [v0, v1, v3, v4, v5, v6], [v0, v2, v3, v4, v5, v6], [v1, v2, v3, v4, v5, v6], [v0, v1, v2, v3, v4, v5, v6]], [0, 0, 0, 0, 7, 14, 7, 1], 4, [[v0, v1, v3, v5], [v0, v2, v3, v5], [v0, v2, v4, v5], [v0, v2, v4, v6], [v1, v2, v4, v6], [v1, v3, v4, v6], [v1, v3, v5, v6]]]

Conditions: none

Audit every mask against every edge,retaining the first uncovered-edge refutation for each failure and every accepted set in source order.Zero smaller-size counts give a lower bound and actual minimum covers attain it.Keep all ties in numeric-mask order,not English/size order.

Step identifiers and dependencies

Rule: Mincover_ALL_masks_acceptance_refutations_ALLcovers_ALLminimizers · Uses: G001, S002

Reverse checks

  • S003 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S002 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S001 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.

Result

([v0, v1, v2, v3, v4, v5, v6], [[v0, v1], [v0, v6], [v1, v2], [v2, v3], [v3, v4], [v4, v5], [v5, v6]], [[v0, v1, v3, v5], [v0, v2, v3, v5], [v0, v1, v2, v3, v5], [v0, v2, v4, v5], [v0, v1, v2, v4, v5], [v0, v1, v3, v4, v5], [v0, v2, v3, v4, v5], [v0, v1, v2, v3, v4, v5], [v0, v2, v4, v6], [v1, v2, v4, v6], [v0, v1, v2, v4, v6], [v1, v3, v4, v6], [v0, v1, v3, v4, v6], [v0, v2, v3, v4, v6], [v1, v2, v3, v4, v6], [v0, v1, v2, v3, v4, v6], [v1, v3, v5, v6], [v0, v1, v3, v5, v6], [v0, v2, v3, v5, v6], [v1, v2, v3, v5, v6], [v0, v1, v2, v3, v5, v6], [v0, v2, v4, v5, v6], [v1, v2, v4, v5, v6], [v0, v1, v2, v4, v5, v6], [v1, v3, v4, v5, v6], [v0, v1, v3, v4, v5, v6], [v0, v2, v3, v4, v5, v6], [v1, v2, v3, v4, v5, v6], [v0, v1, v2, v3, v4, v5, v6]], 4, [[v0, v1, v3, v5], [v0, v2, v3, v5], [v0, v2, v4, v5], [v0, v2, v4, v6], [v1, v2, v4, v6], [v1, v3, v4, v6], [v1, v3, v5, v6]], all_vertex_subsets_are_audited_before_selecting_all_minimizers)

The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.

This question review and source binding

Review date: 2026-10-26

Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.

Source hashes and review receipts
  • input commit: 0f7be61e2c22317a4075561dc822c87d881a50db
  • original question SHA-256: cc65fe070048f21c33888bd47c35764df093d9b3f8db8f5df4b0cec0aed53f76
  • candidate record SHA-256: d3dc681a59c3c9638db17051b4ece398986657a837c99edccffd0ea4b7ee10bf
  • semantic review receipt SHA-256: 90df1e889242e9afdf01e068788ee8500ef366ffcfc0496e30a6800de32631c3
  • question-first witness SHA-256: ae1e849608590ca856c9f3b6911ba58e3bf53c608eb7369606192a770f48bd5c
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON