Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Dirac–Rose, §1, p. 48 (cited) — every nonempty finite chordal graph has a simplicial vertex

Proved
GavrilSubtree.Chordal.exists_isSimplicial

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

chordal-graphp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1simplicial-vertex

Let GGG be a finite chordal graph with at least one vertex. Then GGG has a simplicial vertex: a vertex vvv whose set of neighbours Γv\Gamma vΓv is completely connected,

∃v∈V: Γv is a completely connected set of G.\exists v \in V : \ \Gamma v \text{ is a completely connected set of } G.∃v∈V: Γv is a completely connected set of G.

The paper cites this theorem of Dirac and Rose (references [14], [15]) in its introduction and uses it in the inductive step of the proof of Theorem 3.

Formalization Note The hypothesis that VVV is nonempty is added: the statement "has a vertex" presupposes one, and it fails for the empty graph. The paper applies the theorem to a connected graph that is not complete, which is nonempty.

Preamble
import Mathlib
import Definitions.Def_GavrilSubtree_Chordal_Setting
Formal statement
namespace GavrilSubtree.Chordal

universe u

theorem exists_isSimplicial {V : Type u} [Fintype V] [Nonempty V] (G : SimpleGraph V)
    (hG : IsChordal G) : ∃ v, IsSimplicial G v := by sorry

end GavrilSubtree.Chordal
Source
Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs, J. Combin. Theory Ser. B 16 (1974), p. 48, §1 (theorem of Dirac [14] and Rose [15], cited)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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