# 第 26087 題：最小頂點覆蓋

[返回所在分頁 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-0037)

本頁是已完成第二對話 AI 數理與中英語義覆核的教學詳解，只支持本題明示的模型與前提。沒有人工審查或新 Lean 證明，也不提升原題或 MKO 的 Canonical 真值狀態。

R0051-26087 · q-20261015-advance-20261115-r06-minimum-vertex-cover-0037



## 原題與已知條件

bounded finite simple graph的全部vertex subsets與all-edge cover audit。操作=mincover-nonminimum-witness；資料={"vertices":["v0","v1","v2","v3","v4","v5"],"edges":[["v0","v1"],["v1","v2"],["v2","v3"],["v3","v4"],["v4","v5"],["v5","v0"]],"candidate":["v0","v1","v2","v3","v4","v5"]}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。


- G001 — bounded finite simple graph的全部vertex subsets與all-edge cover audit。操作=mincover-nonminimum-witness；資料={"vertices":["v0","v1","v2","v3","v4","v5"],"edges":[["v0","v1"],["v1","v2"],["v2","v3"],["v3","v4"],["v4","v5"],["v5","v0"]],"candidate":["v0","v1","v2","v3","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-nonminimum-witness]

操作後

derived = [[candidate, cover, candidate_size, minimum_size, smaller_cover, minimum, certificate]]

條件：無

本頁直接列完整來源欄序，不需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], [v1, v2], [v2, v3], [v3, v4], [v4, v5], [v5, v0]], [v0, v1, v2, v3, v4, v5]]

操作後

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

條件：無

非空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, v5], [v1, v2], [v2, v3], [v3, v4], [v4, v5]], 64]

操作後

derived = [[21, 23, 27, 29, 31, 42, 43, 45, 46, 47, 53, 54, 55, 58, 59, 61, 62, 63], [[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], [22, 1], [24, 0], [25, 2], [26, 1], [28, 0], [30, 1], [32, 0], [33, 2], [34, 3], [35, 3], [36, 0], [37, 4], [38, 4], [39, 4], [40, 0], [41, 2], [44, 0], [48, 0], [49, 2], [50, 3], [51, 3], [52, 0], [56, 0], [57, 2], [60, 0]], [[v0, v2, v4], [v0, v1, v2, v4], [v0, v1, v3, v4], [v0, v2, v3, v4], [v0, v1, v2, v3, v4], [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]], [0, 0, 0, 2, 9, 6, 1], 3, [[v0, v2, v4], [v1, v3, 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 = [[v0, v1, v2, v3, v4, v5], [[v0, v1], [v0, v5], [v1, v2], [v2, v3], [v3, v4], [v4, v5]]]

操作後

derived = [[[[v0, v1], 是], [[v0, v5], 是], [[v1, v2], 是], [[v2, v3], 是], [[v3, v4], 是], [[v4, v5], 是]], 6, 3, [v0, v2, v4]]

條件：無

先核candidate真cover；較小解取完整source清單的首minimum，不用任意小集合代替。

步驟識別與依賴規則：Mincover_actual_candidate_complete_cover_and_smaller_witness · 依賴：G001, S003









## 逐步反向核對


- S004 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
- S003 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
- S002 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
- S001 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。





## 結論

([v0, v1, v2, v3, v4, v5], 是, 6, 3, [v0, v2, v4], 否, explicit_smaller_cover_refutes_minimum_status)

依上列完整代值及條件核對得到原題答案；原題編號、格式與狀態保持不變。





## 本題覆核與來源綁定

覆核日期：2026-10-26

原題、答案、步驟表達式、數值 AST 與既有歷史保持原樣；原來的候選狀態屬於來源歷史，不覆寫為形式化證明。

來源雜湊與覆核憑證
- input commit: 0f7be61e2c22317a4075561dc822c87d881a50db
- original question SHA-256: c20f4b5c874afcf27fed6a968a42a0c61f5271071d820516841623ae8382a790
- candidate record SHA-256: a0f64fef07647f3c71959234927965ce549b2325cdb748469e883edd79f870e4
- 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-0037.json)




