Explore related knowledge and questions →

Question 25408: Every Undirected Edge Needs at Least One Selected Endpoint

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 128

← Question derivation index · Original question batch

R0049-25408 · q-20261015-advance-20261114-r07-vertex-cover-0008

Original question and givens

Use complete finite unique vertices=[v0, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10], loop-free simple undirected edges=[[v0, v1], [v1, v2], [v2, v3], [v3, v4], [v4, v5], [v5, v6], [v6, v7], [v7, v8], [v8, v9], [v9, v10]] and unique candidate subset=[v0, v1, v2, v3, v4, v5, v6, v8, v9, v10]. Edges normalize to sorted unordered pairs and are duplicate-free. A cover selects at least one endpoint of every edge; isolated vertices need not be selected. Give (vertices, edges, candidate, edge_coverage_rows, cover, uncovered_edge_or_null, certificate).

  • G001 — Use complete finite unique vertices=[v0, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10], loop-free simple undirected edges=[[v0, v1], [v1, v2], [v2, v3], [v3, v4], [v4, v5], [v5, v6], [v6, v7], [v7, v8], [v8, v9], [v9, v10]] and unique candidate subset=[v0, v1, v2, v3, v4, v5, v6, v8, v9, v10]. Edges normalize to sorted unordered pairs and are duplicate-free. A cover selects at least one endpoint of every edge; isolated vertices need not be selected. Give (vertices, edges, candidate, edge_coverage_rows, cover, uncovered_edge_or_null, 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 = [vcover-complete-edge-audit]

After

derived = [[vertices, edges, candidate, edge_coverage_rows, cover, uncovered_edge_or_null, certificate]]

Conditions: none

List the full source field order without JavaScript.LP boundary modes all have6 fields but select different roles from the original mode,not answer shape.

Step identifiers and dependencies

Rule: source_ordered_fields_without_JS · Uses: G001

S002 · implies

Before

source roles = [[v0, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10], [[v0, v1], [v1, v2], [v2, v3], [v3, v4], [v4, v5], [v5, v6], [v6, v7], [v7, v8], [v8, v9], [v9, v10]], [v0, v1, v2, v3, v4, v5, v6, v8, v9, v10]]

After

derived = [[v0, v1, v10, v2, v3, v4, v5, v6, v7, v8, v9], [[v0, v1], [v1, v2], [v10, v9], [v2, v3], [v3, v4], [v4, v5], [v5, v6], [v6, v7], [v7, v8], [v8, v9]], [v0, v1, v10, v2, v3, v4, v5, v6, v8, v9]]

Conditions: none

The carrier is nonempty with at most12 vertices.Normalize endpoints by JS UTF16<,then source English canonical edge order.Reject loops/reversed duplicate edges;this is not a directed graph or edge cover.

Step identifiers and dependencies

Rule: Vcover_complete_simple_undirected_graph_UTF16_then_English_order · Uses: G001, S001

S003 · implies

Before

source roles = [0, [v0, v1], [v0, v1, v10, v2, v3, v4, v5, v6, v8, v9]]

After

derived = [[Yes, Yes], Yes]

Conditions: none

This edge is covered iff at least one endpoint is selected.Check the entire edge table,not vertex count.

Step identifiers and dependencies

Rule: Vcover_EVERY_edge_selected_endpoint_disjunction · Uses: G001, S002

S004 · implies

Before

source roles = [1, [v1, v2], [v0, v1, v10, v2, v3, v4, v5, v6, v8, v9]]

After

derived = [[Yes, Yes], Yes]

Conditions: none

This edge is covered iff at least one endpoint is selected.Check the entire edge table,not vertex count.

Step identifiers and dependencies

Rule: Vcover_EVERY_edge_selected_endpoint_disjunction · Uses: G001, S003

S005 · implies

Before

source roles = [2, [v10, v9], [v0, v1, v10, v2, v3, v4, v5, v6, v8, v9]]

After

derived = [[Yes, Yes], Yes]

Conditions: none

This edge is covered iff at least one endpoint is selected.Check the entire edge table,not vertex count.

Step identifiers and dependencies

Rule: Vcover_EVERY_edge_selected_endpoint_disjunction · Uses: G001, S004

S006 · implies

Before

source roles = [3, [v2, v3], [v0, v1, v10, v2, v3, v4, v5, v6, v8, v9]]

After

derived = [[Yes, Yes], Yes]

Conditions: none

This edge is covered iff at least one endpoint is selected.Check the entire edge table,not vertex count.

Step identifiers and dependencies

Rule: Vcover_EVERY_edge_selected_endpoint_disjunction · Uses: G001, S005

S007 · implies

Before

source roles = [4, [v3, v4], [v0, v1, v10, v2, v3, v4, v5, v6, v8, v9]]

After

derived = [[Yes, Yes], Yes]

Conditions: none

This edge is covered iff at least one endpoint is selected.Check the entire edge table,not vertex count.

Step identifiers and dependencies

Rule: Vcover_EVERY_edge_selected_endpoint_disjunction · Uses: G001, S006

S008 · implies

Before

source roles = [5, [v4, v5], [v0, v1, v10, v2, v3, v4, v5, v6, v8, v9]]

After

derived = [[Yes, Yes], Yes]

Conditions: none

This edge is covered iff at least one endpoint is selected.Check the entire edge table,not vertex count.

Step identifiers and dependencies

Rule: Vcover_EVERY_edge_selected_endpoint_disjunction · Uses: G001, S007

S009 · implies

Before

source roles = [6, [v5, v6], [v0, v1, v10, v2, v3, v4, v5, v6, v8, v9]]

After

derived = [[Yes, Yes], Yes]

Conditions: none

This edge is covered iff at least one endpoint is selected.Check the entire edge table,not vertex count.

Step identifiers and dependencies

Rule: Vcover_EVERY_edge_selected_endpoint_disjunction · Uses: G001, S008

S010 · implies

Before

source roles = [7, [v6, v7], [v0, v1, v10, v2, v3, v4, v5, v6, v8, v9]]

After

derived = [[Yes, No], Yes]

Conditions: none

This edge is covered iff at least one endpoint is selected.Check the entire edge table,not vertex count.

Step identifiers and dependencies

Rule: Vcover_EVERY_edge_selected_endpoint_disjunction · Uses: G001, S009

S011 · implies

Before

source roles = [8, [v7, v8], [v0, v1, v10, v2, v3, v4, v5, v6, v8, v9]]

After

derived = [[No, Yes], Yes]

Conditions: none

This edge is covered iff at least one endpoint is selected.Check the entire edge table,not vertex count.

Step identifiers and dependencies

Rule: Vcover_EVERY_edge_selected_endpoint_disjunction · Uses: G001, S010

S012 · implies

Before

source roles = [9, [v8, v9], [v0, v1, v10, v2, v3, v4, v5, v6, v8, v9]]

After

derived = [[Yes, Yes], Yes]

Conditions: none

This edge is covered iff at least one endpoint is selected.Check the entire edge table,not vertex count.

Step identifiers and dependencies

Rule: Vcover_EVERY_edge_selected_endpoint_disjunction · Uses: G001, S011

S013 · implies

Before

source roles = [[[[v0, v1], Yes], [[v1, v2], Yes], [[v10, v9], Yes], [[v2, v3], Yes], [[v3, v4], Yes], [[v4, v5], Yes], [[v5, v6], Yes], [[v6, v7], Yes], [[v7, v8], Yes], [[v8, v9], Yes]]]

After

derived = [Yes, null, []]

Conditions: none

Conjoin all edges and retain the first uncovered edge in source order,or null,notFalse.Isolated vertices have no incident coverage obligation and are optional.

Step identifiers and dependencies

Rule: Vcover_COMPLETE_edge_conjunction_FIRST_uncovered_or_NULL · Uses: G001, S012

Reverse checks

  • S013 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S012 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S011 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S010 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S009 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S008 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S007 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S006 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • 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

([v0, v1, v10, v2, v3, v4, v5, v6, v7, v8, v9], [[v0, v1], [v1, v2], [v10, v9], [v2, v3], [v3, v4], [v4, v5], [v5, v6], [v6, v7], [v7, v8], [v8, v9]], [v0, v1, v10, v2, v3, v4, v5, v6, v8, v9], [[[v0, v1], Yes], [[v1, v2], Yes], [[v10, v9], Yes], [[v2, v3], Yes], [[v3, v4], Yes], [[v4, v5], Yes], [[v5, v6], Yes], [[v6, v7], Yes], [[v7, v8], Yes], [[v8, v9], Yes]], Yes, null, vertex_cover_requires_every_edge_to_have_at_least_one_selected_endpoint)

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: 9b84edcab1e97aadd48cfbd6cf0a5c878cd745e9a9329f37d699e0f74b3c19c9
  • candidate record SHA-256: 9d0b6aadce317d1a0f0bf5500cb7065f142309e69273580cffd7c2b8fd6bcf08
  • semantic review receipt SHA-256: 6212b8b0b3b273f3a514e26ebd17d7e81219c56a8f47e40047ee2b6bf01d1ba3
  • question-first witness SHA-256: f32a23d5e1b66c7794c60def58741bcdfacff24f3cdfc9bc48109c8f71543cf3
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON