Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

THEOREM 3, p. 51 — a finite graph is a subtree graph if and only if it is chordal

Proved
GavrilSubtree.Chordal.theorem_3

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

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

Let GGG be a finite simple graph. Then GGG is the intersection graph of a family of subtrees of a tree if and only if GGG is chordal, i.e. every simple circuit of GGG with more than three vertices has an edge connecting two non-consecutive vertices of the circuit:

G is a subtree graph  ⟺  G is chordal.G \text{ is a subtree graph} \iff G \text{ is chordal}.G is a subtree graph⟺G is chordal.

This is the main theorem of Gavril's paper. It characterizes chordal graphs geometrically, generalizing interval graphs (intersection graphs of intervals of a line, the subtree graphs of a path), and underlies the clique-tree representation used for chordal graphs in sparse matrix elimination, database theory and graphical models.

Formalization Note Trees are combinatorial trees and subtrees are nonempty vertex sets inducing connected subgraphs (see the definitions file; this gives the same class of graphs as the paper's topological subtrees). Chordality is the cycle–chord definition, not a perfect-elimination ordering. VVV is finite, as in the paper, and may be empty.

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

universe u

theorem theorem_3 {V : Type u} [Fintype V] (G : SimpleGraph V) :
    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, Theorem 3
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