Explore related knowledge and questions →
← Question derivation index · Original question batch
R0051-26025 · q-20261015-advance-20261115-r06-minimum-vertex-cover-0100
Use complete unique vertices=[v0, v1, v2, v3, v4, v5] and loop-free duplicate-free undirected edges=[[v0, v1], [v0, v2], [v0, v3], [v0, v4], [v0, v5], [v1, v2], [v1, v3], [v1, v4], [v1, v5], [v2, v3], [v2, v4], [v2, v5], [v3, v4], [v3, v5], [v4, v5]]. An edge needs at least one selected endpoint. Preserve source canonical subset order. Mode=multiple_minima. Give (mode, edges, minimum_size, minimum_covers, mode_certificate, boundary).
G001 — Use complete unique vertices=[v0, v1, v2, v3, v4, v5] and loop-free duplicate-free undirected edges=[[v0, v1], [v0, v2], [v0, v3], [v0, v4], [v0, v5], [v1, v2], [v1, v3], [v1, v4], [v1, v5], [v2, v3], [v2, v4], [v2, v5], [v3, v4], [v3, v5], [v4, v5]]. An edge needs at least one selected endpoint. Preserve source canonical subset order. Mode=multiple_minima. Give (mode, edges, minimum_size, minimum_covers, mode_certificate, boundary).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.
Before
source roles = [mincover-empty-multiple-boundary]
After
derived = [[mode, edges, minimum_size, minimum_covers, mode_certificate, boundary]]
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.
Rule: source_ordered_fields_without_JS · Uses: G001
Before
source roles = [[v0, v1, v2, v3, v4, v5], [[v0, v1], [v0, v2], [v0, v3], [v0, v4], [v0, v5], [v1, v2], [v1, v3], [v1, v4], [v1, v5], [v2, v3], [v2, v4], [v2, v5], [v3, v4], [v3, v5], [v4, v5]], null]
After
derived = [[v0, v1, v2, v3, v4, v5], [[v0, v1], [v0, v2], [v0, v3], [v0, v4], [v0, v5], [v1, v2], [v1, v3], [v1, v4], [v1, v5], [v2, v3], [v2, v4], [v2, v5], [v3, v4], [v3, v5], [v4, v5]], 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.
Rule: Mincover_complete_simple_graph_UTF16_English_and_optional_candidate · Uses: G001, S001
Before
source roles = [[v0, v1, v2, v3, v4, v5], [[v0, v1], [v0, v2], [v0, v3], [v0, v4], [v0, v5], [v1, v2], [v1, v3], [v1, v4], [v1, v5], [v2, v3], [v2, v4], [v2, v5], [v3, v4], [v3, v5], [v4, v5]], 64]
After
derived = [[31, 47, 55, 59, 61, 62, 63], [[0, 0], [1, 5], [2, 1], [3, 9], [4, 0], [5, 6], [6, 2], [7, 12], [8, 0], [9, 5], [10, 1], [11, 10], [12, 0], [13, 7], [14, 3], [15, 14], [16, 0], [17, 5], [18, 1], [19, 9], [20, 0], [21, 6], [22, 2], [23, 13], [24, 0], [25, 5], [26, 1], [27, 11], [28, 0], [29, 8], [30, 4], [32, 0], [33, 5], [34, 1], [35, 9], [36, 0], [37, 6], [38, 2], [39, 12], [40, 0], [41, 5], [42, 1], [43, 10], [44, 0], [45, 7], [46, 3], [48, 0], [49, 5], [50, 1], [51, 9], [52, 0], [53, 6], [54, 2], [56, 0], [57, 5], [58, 1], [60, 0]], [[v0, v1, v2, v3, v4], [v0, v1, v2, v3, v5], [v0, v1, v2, v4, v5], [v0, v1, v3, v4, v5], [v0, v2, v3, v4, v5], [v1, v2, v3, v4, v5], [v0, v1, v2, v3, v4, v5]], [0, 0, 0, 0, 0, 6, 1], 5, [[v0, v1, v2, v3, v4], [v0, v1, v2, v3, v5], [v0, v1, v2, v4, v5], [v0, v1, v3, v4, v5], [v0, v2, v3, v4, v5], [v1, v2, v3, v4, 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.
Rule: Mincover_ALL_masks_acceptance_refutations_ALLcovers_ALLminimizers · Uses: G001, S002
Before
source roles = [multiple_minima, [v0, v1, v2, v3, v4, v5], [[v0, v1], [v0, v2], [v0, v3], [v0, v4], [v0, v5], [v1, v2], [v1, v3], [v1, v4], [v1, v5], [v2, v3], [v2, v4], [v2, v5], [v3, v4], [v3, v5], [v4, v5]]]
After
derived = [5, [[v0, v1, v2, v3, v4], [v0, v1, v2, v3, v5], [v0, v1, v2, v4, v5], [v0, v1, v3, v4, v5], [v0, v2, v3, v4, v5], [v1, v2, v3, v4, v5]], Yes]
Conditions: none
empty_graph means edgeless,not an empty vertex carrier;the unique minimum is empty.multiple_minima retains all of at least two solutions,not one witness as uniqueness.No Konig,weighted or directed extension.
Rule: Mincover_original_empty_OR_multiple_boundary_not_uniqueness_guess · Uses: G001, S003
S004 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.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.(multiple_minima, [[v0, v1], [v0, v2], [v0, v3], [v0, v4], [v0, v5], [v1, v2], [v1, v3], [v1, v4], [v1, v5], [v2, v3], [v2, v4], [v2, v5], [v3, v4], [v3, v5], [v4, v5]], 5, [[v0, v1, v2, v3, v4], [v0, v1, v2, v3, v5], [v0, v1, v2, v4, v5], [v0, v1, v3, v4, v5], [v0, v2, v3, v4, v5], [v1, v2, v3, v4, v5]], Yes, empty_graph_has_unique_empty_minimum_cover_while_other_graphs_may_have_multiple_minima_without_Konig_or_weighted_claims)
The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.
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.
input commit: 0f7be61e2c22317a4075561dc822c87d881a50dboriginal question SHA-256: 948d7e84e09f719320d016c6f7cd9f99cacb652a6b0dee255320f90d87eb495ccandidate record SHA-256: d18ea63b577bac07c2648478da8ef57742016c791991a5d38fd4640ba4672ec2semantic review receipt SHA-256: 90df1e889242e9afdf01e068788ee8500ef366ffcfc0496e30a6800de32631c3question-first witness SHA-256: ae1e849608590ca856c9f3b6911ba58e3bf53c608eb7369606192a770f48bd5cLean: NOT_RUN · human review: NOT_PERFORMED