Question 13336: Check Every Consecutive Step in a Vertex Sequence

Original question and givens

Use the complete finite undirected loop-free simple graph on Fin(6)={0,…,5} with edge set=[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 2], [1, 3], [1, 4], [1, 5], [2, 3], [2, 4], [2, 5], [3, 4], [3, 5], [4, 5]] and nonempty ordered vertex sequence=[0, 3, 0, 1, 1]. A walk requires every consecutive pair to be adjacent. A simple path additionally forbids all repeated vertices. Edge length is the number of steps, not the number of listed vertices; a singleton vertex is a length-zero simple path. No directed-graph or general cycle theorem is claimed. Give (vertices,all bad [zero-based step index,from,to] records,walk?).

• G001 — Use the complete finite undirected loop-free simple graph on Fin(6)={0,…,5} with edge set=[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 2], [1, 3], [1, 4], [1, 5], [2, 3], [2, 4], [2, 5], [3, 4], [3, 5], [4, 5]] and nonempty ordered vertex sequence=[0, 3, 0, 1, 1]. A walk requires every consecutive pair to be adjacent. A simple path additionally forbids all repeated vertices. Edge length is the number of steps, not the number of listed vertices; a singleton vertex is a length-zero simple path. No directed-graph or general cycle theorem is claimed. Give (vertices,all bad [zero-based step index,from,to] records,walk?).

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.

• mko-graph-walk-simple-path

Step-by-step derivation

carrier Fin(6);raw edges=[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 2], [1, 3], [1, 4], [1, 5], [2, 3], [2, 4], [2, 5], [3, 4], [3, 5], [4, 5]];original vertex sequence=[0, 3, 0, 1, 1]

canonical undirected simple edges=[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [1, 2], [1, 3], [1, 4], [1, 5], [2, 3], [2, 4], [2, 5], [3, 4], [3, 5], [4, 5]];nonempty typed sequence retained

proposed step index=0;from=0;to=3;unordered step edge=[0, 3]

edge present=Yes

proposed step index=1;from=3;to=0;unordered step edge=[0, 3]

edge present=Yes

proposed step index=2;from=0;to=1;unordered step edge=[0, 1]

edge present=Yes

proposed step index=3;from=1;to=1;unordered step edge=[1, 1]

edge present=No

all bad proposed steps=[[3, 1, 1]]

walk=No

Reverse checks

• 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

([0, 3, 0, 1, 1], [[3, 1, 1]], No)

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.