AFTD Auto-Formalizing Theoretical Domains

simple_graph_is_cycle_subgraph

def

A subgraph C of a simple graph G is a cycle if C is the subgraph traversed by a cycle walk in G.

Statement

def simple_graph_is_cycle_subgraph {V : Type*} {G : SimpleGraph V} (C : G.Subgraph) : Prop
Defined in
arXiv:2611.07145 Sec. 2
Verified
08 Nov 2026
Axioms
none listed
Used by 1
  • simple_graph_is_longest_cycleA subgraph C of a simple graph G is a longest cycle if it is a cycle subgraph and its vertex set has maximum cardinality among all cycle…

Read back from the Lean

Given a type V, a simple graph G on V, and a subgraph C of G, simple_graph_is_cycle_subgraph C asserts that there exist a vertex v : V and a closed walk p : G.Walk v v in G such that p is a cycle (p.IsCycle) and the subgraph generated by the walk p (p.toSubgraph) is equal to C.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- A subgraph C of a simple graph G is a cycle if it is the subgraph of a cycle walk. -/
def simple_graph_is_cycle_subgraph {V : Type*} {G : SimpleGraph V} (C : G.Subgraph) : Prop := ∃ (v : V) (p : G.Walk v v), p.IsCycle ∧ p.toSubgraph = C
See it in the graphDiscuss this resultChallenge it