Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 10 — a connected graph of minimum degree ≥2\ge 2≥2 has an edge {x,y}\{x,y\}{x,y} with G[V∖{x,y}]G[V\setminus\{x,y\}]G[V∖{x,y}] connected

Proved
OneTwoThree.Weighting.lemma_10

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

1-2-3-conjectureconnectivitygraph-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let G=(V,E)G=(V,E)G=(V,E) be a finite connected graph with minimum degree at least 222. Then there exist two vertices x,y∈Vx,y\in Vx,y∈V such that {x,y}∈E\{x,y\}\in E{x,y}∈E and the induced subgraph

G[V∖{x,y}]G[V\setminus\{x,y\}]G[V∖{x,y}]

is connected.

In the proof of Theorem 1 this non-separating edge is the starting point of the case analysis for graphs without vertices of degree one.

Formalization Note Mathlib's Connected requires a nonempty vertex set. Minimum degree at least 222 forces ∣V∣≥3|V|\ge 3∣V∣≥3, so V∖{x,y}V\setminus\{x,y\}V∖{x,y} is nonempty and the conclusion asks for genuine connectivity.

Preamble
import Mathlib
Formal statement
namespace OneTwoThree.Weighting

open Finset SimpleGraph

theorem lemma_10 {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V)
    [DecidableRel G.Adj] (hG : G.Connected) (hdeg : ∀ v, 2 ≤ G.degree v) :
    ∃ x y : V, G.Adj x y ∧ (G.induce ({x, y}ᶜ : Set V)).Connected := by sorry

end OneTwoThree.Weighting
Source
Keusch, A Solution to the 1-2-3 Conjecture, arXiv:2303.02611v4, p. 11, Lemma 10
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me