Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of THEOREM 3 (first half), p. 51 — every subtree graph is chordal

Proved
GavrilSubtree.Chordal.isChordal_of_isSubtreeGraph

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

chordal-graphp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1subtree-graph

Every subtree graph is chordal: if GGG is the intersection graph of a family of subtrees of a tree, then every simple circuit of GGG with more than three vertices has an edge joining two non-consecutive vertices of the circuit.

G is a subtree graph  ⟹  G is chordal.G \text{ is a subtree graph} \implies G \text{ is chordal}.G is a subtree graph⟹G is chordal.

This is the "only if" half of the main theorem (Theorem 3). A chordless circuit of length at least four in GGG would produce a circuit in the tree.

Formalization Note The vertex set VVV is not assumed finite; the statement holds for arbitrary graphs, which is stronger than the paper's finite setting.

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

universe u

theorem isChordal_of_isSubtreeGraph {V : Type u} (G : SimpleGraph V)
    (hG : IsSubtreeGraph G) : IsChordal G := 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. 51, §2, proof of Theorem 3, first paragraph
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