Use vertex carrier Fin(17)={0,…,16} and no edges, with n=17≥1. Give (vertex_count, edge_count, length_zero_circuit, convention, boundary).
G001 — Use vertex carrier Fin(17)={0,…,16} and no edges, with n=17≥1. Give (vertex_count, edge_count, length_zero_circuit, convention, boundary).
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.
Keep the historical interface marker in the original snapshot while listing the original ordered fields here.No JavaScript or external table is needed for the main text,and field labels are not mathematical evidence.
choose single-vertex walk[0],length0;all edges used exactly once vacuously;length_zero_circuit_on_nonempty_vertex_set
Conditions: none
Since n≥1 vertex0 is available.A one-vertex walk has length0 and is a circuit by the stated convention.It need not visit all isolated vertices,does not admit the empty-vertex graph,and gives no Hamiltonian claim.
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.