Explore related knowledge and questions →

Question 26029: 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-26029 · q-20261015-advance-20261115-r06-minimum-vertex-cover-0004

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]]. 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]]. 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]], null]

After

derived = [[v0, v1, v2, v3, v4, v5, v6], [[v0, v1], [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], [v1, v2], [v2, v3], [v3, v4], [v4, v5], [v5, v6]], 128]

After

derived = [[42, 43, 45, 46, 47, 53, 54, 55, 58, 59, 61, 62, 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, 1], [2, 2], [3, 2], [4, 0], [5, 3], [6, 3], [7, 3], [8, 0], [9, 1], [10, 4], [11, 4], [12, 0], [13, 4], [14, 4], [15, 4], [16, 0], [17, 1], [18, 2], [19, 2], [20, 0], [21, 5], [22, 5], [23, 5], [24, 0], [25, 1], [26, 5], [27, 5], [28, 0], [29, 5], [30, 5], [31, 5], [32, 0], [33, 1], [34, 2], [35, 2], [36, 0], [37, 3], [38, 3], [39, 3], [40, 0], [41, 1], [44, 0], [48, 0], [49, 1], [50, 2], [51, 2], [52, 0], [56, 0], [57, 1], [60, 0], [64, 0], [65, 1], [66, 2], [67, 2], [68, 0], [69, 3], [70, 3], [71, 3], [72, 0], [73, 1], [74, 4], [75, 4], [76, 0], [77, 4], [78, 4], [79, 4], [80, 0], [81, 1], [82, 2], [83, 2], [84, 0], [88, 0], [89, 1], [92, 0], [96, 0], [97, 1], [98, 2], [99, 2], [100, 0], [101, 3], [102, 3], [103, 3], [104, 0], [105, 1], [108, 0], [112, 0], [113, 1], [114, 2], [115, 2], [116, 0], [120, 0], [121, 1], [124, 0]], [[v1, v3, v5], [v0, v1, v3, v5], [v0, v2, v3, v5], [v1, v2, v3, v5], [v0, v1, v2, v3, v5], [v0, v2, v4, v5], [v1, v2, v4, v5], [v0, v1, v2, v4, v5], [v1, v3, v4, v5], [v0, v1, v3, v4, v5], [v0, v2, v3, v4, v5], [v1, 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, 1, 10, 15, 7, 1], 3, [[v1, v3, v5]]]

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], [v1, v2], [v2, v3], [v3, v4], [v4, v5], [v5, v6]], [[v1, v3, v5], [v0, v1, v3, v5], [v0, v2, v3, v5], [v1, v2, v3, v5], [v0, v1, v2, v3, v5], [v0, v2, v4, v5], [v1, v2, v4, v5], [v0, v1, v2, v4, v5], [v1, v3, v4, v5], [v0, v1, v3, v4, v5], [v0, v2, v3, v4, v5], [v1, 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]], 3, [[v1, v3, v5]], 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: 6ad074b0b7959787deb0264891a329515999536691560764b60a48ba03fbc679
  • candidate record SHA-256: 5a7e64d276e63fdee6da7f107d72df7bee4bcf342af36df1b0ce15aa7b9f1180
  • semantic review receipt SHA-256: 90df1e889242e9afdf01e068788ee8500ef366ffcfc0496e30a6800de32631c3
  • question-first witness SHA-256: ae1e849608590ca856c9f3b6911ba58e3bf53c608eb7369606192a770f48bd5c
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON