OCMEBilingual mathematics & derivations繁體中文

Explore related knowledge and questions →

Question 26061: A Cover Can Resist Every Single Deletion yet Be Larger than Another Cover

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-26061 · q-20261015-advance-20261115-r06-minimum-vertex-cover-0061

Original question and givens

Use complete unique vertices=[c0, l0_0, l0_1, c1, l1_0, l1_1] and loop-free duplicate-free undirected edges=[[c0, l0_0], [c0, l0_1], [c1, l1_0], [c1, l1_1]], candidate cover=[l0_0, l0_1, l1_0, l1_1]. An edge needs at least one selected endpoint. Preserve source canonical subset order. Give (candidate, deletion_rows, inclusion_minimal, minimum_size, smaller_cover, minimum, certificate).

  • G001 — Use complete unique vertices=[c0, l0_0, l0_1, c1, l1_0, l1_1] and loop-free duplicate-free undirected edges=[[c0, l0_0], [c0, l0_1], [c1, l1_0], [c1, l1_1]], candidate cover=[l0_0, l0_1, l1_0, l1_1]. An edge needs at least one selected endpoint. Preserve source canonical subset order. Give (candidate, deletion_rows, inclusion_minimal, minimum_size, smaller_cover, minimum, 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-minimal-not-minimum]

After

derived = [[candidate, deletion_rows, inclusion_minimal, minimum_size, smaller_cover, minimum, 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 = [[c0, l0_0, l0_1, c1, l1_0, l1_1], [[c0, l0_0], [c0, l0_1], [c1, l1_0], [c1, l1_1]], [l0_0, l0_1, l1_0, l1_1]]

After

derived = [[c0, c1, l0_0, l0_1, l1_0, l1_1], [[c0, l0_0], [c0, l0_1], [c1, l1_0], [c1, l1_1]], [l0_0, l0_1, l1_0, l1_1]]

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 = [[c0, c1, l0_0, l0_1, l1_0, l1_1], [[c0, l0_0], [c0, l0_1], [c1, l1_0], [c1, l1_1]], 64]

After

derived = [[3, 7, 11, 14, 15, 19, 23, 27, 30, 31, 35, 39, 43, 46, 47, 49, 51, 53, 55, 57, 59, 60, 61, 62, 63], [[0, 0], [1, 2], [2, 0], [4, 1], [5, 2], [6, 1], [8, 0], [9, 2], [10, 0], [12, 2], [13, 2], [16, 0], [17, 3], [18, 0], [20, 1], [21, 3], [22, 1], [24, 0], [25, 3], [26, 0], [28, 3], [29, 3], [32, 0], [33, 2], [34, 0], [36, 1], [37, 2], [38, 1], [40, 0], [41, 2], [42, 0], [44, 2], [45, 2], [48, 0], [50, 0], [52, 1], [54, 1], [56, 0], [58, 0]], [[c0, c1], [c0, c1, l0_0], [c0, c1, l0_1], [c1, l0_0, l0_1], [c0, c1, l0_0, l0_1], [c0, c1, l1_0], [c0, c1, l0_0, l1_0], [c0, c1, l0_1, l1_0], [c1, l0_0, l0_1, l1_0], [c0, c1, l0_0, l0_1, l1_0], [c0, c1, l1_1], [c0, c1, l0_0, l1_1], [c0, c1, l0_1, l1_1], [c1, l0_0, l0_1, l1_1], [c0, c1, l0_0, l0_1, l1_1], [c0, l1_0, l1_1], [c0, c1, l1_0, l1_1], [c0, l0_0, l1_0, l1_1], [c0, c1, l0_0, l1_0, l1_1], [c0, l0_1, l1_0, l1_1], [c0, c1, l0_1, l1_0, l1_1], [l0_0, l0_1, l1_0, l1_1], [c0, l0_0, l0_1, l1_0, l1_1], [c1, l0_0, l0_1, l1_0, l1_1], [c0, c1, l0_0, l0_1, l1_0, l1_1]], [0, 0, 1, 6, 11, 6, 1], 2, [[c0, c1]]]

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

S004 · implies

Before

source roles = [[l0_0, l0_1, l1_0, l1_1], [[c0, l0_0], [c0, l0_1], [c1, l1_0], [c1, l1_1]]]

After

derived = [[[[c0, l0_0], Yes], [[c0, l0_1], Yes], [[c1, l1_0], Yes], [[c1, l1_1], Yes]], 4, 2, [c0, c1]]

Conditions: none

First qualify an actual candidate cover.The smaller witness is the first minimum from the complete source list,not an arbitrary small set.

Step identifiers and dependencies

Rule: Mincover_actual_candidate_complete_cover_and_smaller_witness · Uses: G001, S003

S005 · implies

Before

source roles = [[l0_0, l0_1, l1_0, l1_1], [[l0_0, [l0_1, l1_0, l1_1], No], [l0_1, [l0_0, l1_0, l1_1], No], [l1_0, [l0_0, l0_1, l1_1], No], [l1_1, [l0_0, l0_1, l1_0], No]]]

After

derived = [Yes, 2, [c0, c1], No]

Conditions: none

Every single deletion loses coverage,so the candidate is inclusion-minimal.But exhaustive search supplies a strictly smaller cover,so it is not minimum.Superset monotonicity makes deletion tests cover all proper-subset obligations,not maximum or optimal size.

Step identifiers and dependencies

Rule: Mincover_ALL_single_deletions_minimal_BUT_smaller_cover_exists · Uses: G001, S004

Reverse checks

  • S005 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • 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.

Result

([l0_0, l0_1, l1_0, l1_1], [[l0_0, [l0_1, l1_0, l1_1], No], [l0_1, [l0_0, l1_0, l1_1], No], [l1_0, [l0_0, l0_1, l1_1], No], [l1_1, [l0_0, l0_1, l1_0], No]], Yes, 2, [c0, c1], No, inclusion_minimal_is_not_minimum)

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: d47b71f0ec5ba54b4ad80c7ea76f705ed26a704cf99b849bebb3998f1acb9164
  • candidate record SHA-256: f2ccfe26f5669233dfed7063afe08e07d7a8606fde8a5ed0e0317ec9b2d13980
  • semantic review receipt SHA-256: 90df1e889242e9afdf01e068788ee8500ef366ffcfc0496e30a6800de32631c3
  • question-first witness SHA-256: ae1e849608590ca856c9f3b6911ba58e3bf53c608eb7369606192a770f48bd5c
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON