AFTD Auto-Formalizing Theoretical Domains

simple_graph_vertex_connectivity_two_card_three_hamiltonian

theoremverified

For card V = 3 and κ(G) ≥ 2, simple_graph_vertex_connectivity_two_card_three_eq_top forces G = ⊤. Then simple_graph_top_is_hamiltonian yields G.IsHamiltonian.

Statement

theorem simple_graph_vertex_connectivity_two_card_three_hamiltonian {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) (hcard : Fintype.card V = 3) (hκ : 2 ≤ ghz_graph_vertex_connectivity G) : G.IsHamiltonian
Source
step towards radius_independence_connectivity_hamiltonian_interpolation
Verified
31 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3

The proof, explained

The proof shows that any 2-connected simple graph on 3 vertices is Hamiltonian by reducing it to the complete graph. Because the graph has 3 vertices and vertex connectivity at least 2, it must be the complete graph ⊤. Complete graphs on at least 3 vertices are known to be Hamiltonian, so the result follows immediately.

  1. G = ⊤

    By simple_graph_vertex_connectivity_two_card_three_eq_top, any simple graph on 3 vertices with vertex connectivity at least 2 must be the complete graph ⊤.

    line 3

    uses simple_graph_vertex_connectivity_two_card_three_eq_top

      have h : G = ⊤ := simple_graph_vertex_connectivity_two_card_three_eq_top G hcard hκ
  2. G is Hamiltonian

    Substituting ⊤ for G, it remains to show that the complete graph on V is Hamiltonian. By simple_graph_top_is_hamiltonian, the complete graph on any finite vertex set with at least 3 vertices has a Hamiltonian cycle, and the requirement 3 ≤ |V| follows immediately from |V| = 3 by linear arithmetic (omega).

    lines 4–5

    uses simple_graph_top_is_hamiltonian

      rw [h]
      exact simple_graph_top_is_hamiltonian (by omega : 3 ≤ Fintype.card V)
simple_graph_vertex_connectivity_two_card_three_eq_top
A simple graph on 3 vertices with vertex connectivity at least 2 is the complete graph (⊤).
simple_graph_top_is_hamiltonian
The complete graph on a finite vertex set with at least 3 vertices is Hamiltonian.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- Every 2-connected simple graph on 3 vertices contains a Hamilton cycle. -/theorem simple_graph_vertex_connectivity_two_card_three_hamiltonian {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) (hcard : Fintype.card V = 3) (hκ : 2 ≤ ghz_graph_vertex_connectivity G) : G.IsHamiltonian := by  have h : G = ⊤ := simple_graph_vertex_connectivity_two_card_three_eq_top G hcard hκ  rw [h]  exact simple_graph_top_is_hamiltonian (by omega : 3 ≤ Fintype.card V)
See it in the graphDiscuss this resultChallenge it