# 第 26025 題：最小頂點覆蓋 [返回所在分頁 131](https://ocme.evemisslab.com/zh-Hant/questions/page/131/) [← 逐題詳解目錄](https://ocme.evemisslab.com/zh-Hant/questions/) · [原題批次](https://ocme.evemisslab.com/zh-Hant/practice/batch-20261015-advance-20261115-r06-minimum-vertex-cover-foundations/#q-20261015-advance-20261115-r06-minimum-vertex-cover-0100) 本頁是已完成第二對話 AI 數理與中英語義覆核的教學詳解，只支持本題明示的模型與前提。沒有人工審查或新 Lean 證明，也不提升原題或 MKO 的 Canonical 真值狀態。 R0051-26025 · q-20261015-advance-20261115-r06-minimum-vertex-cover-0100 ## 原題與已知條件 bounded finite simple graph的全部vertex subsets與all-edge cover audit。操作=mincover-empty-multiple-boundary；資料={"mode":"multiple_minima","vertices":["v0","v1","v2","v3","v4","v5"],"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"]]}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。 - G001 — bounded finite simple graph的全部vertex subsets與all-edge cover audit。操作=mincover-empty-multiple-boundary；資料={"mode":"multiple_minima","vertices":["v0","v1","v2","v3","v4","v5"],"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"]]}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。 ## 定義與適用範圍 沿用原題明示的論域、假設與來源 MKO 定義。本題已完成第二對話數理與中英語義覆核，並由原始參數逐題獨立重算模型、答案與每個算術步驟；原題仍為 candidate。 - [mko-minimum-vertex-cover](https://ocme.evemisslab.com/zh-Hant/mko/mko-minimum-vertex-cover/) ## 逐步推導 S001 · implies操作前 source roles = [mincover-empty-multiple-boundary] 操作後 derived = [[mode, edges, minimum_size, minimum_covers, mode_certificate, boundary]] 條件：無 本頁直接列完整來源欄序，不需JavaScript；contract的6/4/6/6與IVT的8/7/8由原mode選，不補欄也不由答案形狀猜。 步驟識別與依賴規則：source_ordered_fields_without_JS · 依賴：G001 S002 · implies操作前 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] 操作後 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] 條件：無 非空carrier至多12；端點UTF16排序後edge族English排序，loop/反向duplicate拒絕。未提供candidate時保持null，不擅補空candidate。 步驟識別與依賴規則：Mincover_complete_simple_graph_UTF16_English_and_optional_candidate · 依賴：G001, S001 S003 · implies操作前 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] 操作後 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]]] 條件：無 逐全部mask核所有edges；每個失敗mask保首uncovered edge index反例，通過者全列source順序。較小size計數0給下界，實際最小解給上界；全部ties依numeric mask保留，不改English/大小序。 步驟識別與依賴規則：Mincover_ALL_masks_acceptance_refutations_ALLcovers_ALLminimizers · 依賴：G001, S002 S004 · implies操作前 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]]] 操作後 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]], 是] 條件：無 empty_graph指無邊而非空vertices；唯一minimum是空集。multiple_minima列全部至少兩個解，不把一個witness當唯一解，也不引König／weighted／directed版本。 步驟識別與依賴規則：Mincover_original_empty_OR_multiple_boundary_not_uniqueness_guess · 依賴：G001, S003 ## 逐步反向核對 - S004 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。 - S003 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。 - S002 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。 - S001 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。 ## 結論 (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]], 是, empty_graph_has_unique_empty_minimum_cover_while_other_graphs_may_have_multiple_minima_without_Konig_or_weighted_claims) 依上列完整代值及條件核對得到原題答案；原題編號、格式與狀態保持不變。 ## 本題覆核與來源綁定 覆核日期：2026-10-26 原題、答案、步驟表達式、數值 AST 與既有歷史保持原樣；原來的候選狀態屬於來源歷史，不覆寫為形式化證明。 來源雜湊與覆核憑證 - input commit: 0f7be61e2c22317a4075561dc822c87d881a50db - original question SHA-256: 948d7e84e09f719320d016c6f7cd9f99cacb652a6b0dee255320f90d87eb495c - candidate record SHA-256: d18ea63b577bac07c2648478da8ef57742016c791991a5d38fd4640ba4672ec2 - semantic review receipt SHA-256: 90df1e889242e9afdf01e068788ee8500ef366ffcfc0496e30a6800de32631c3 - question-first witness SHA-256: ae1e849608590ca856c9f3b6911ba58e3bf53c608eb7369606192a770f48bd5c - Lean: NOT_RUN · human review: NOT_PERFORMED [同源完整 JSON](https://ocme.evemisslab.com/data/question-derivations/questions/q-20261015-advance-20261115-r06-minimum-vertex-cover-0100.json)