Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

THEOREM 2, p. 51 — G is a subtree graph iff there is a tree on μ(G) in which every μ_v(G) induces a connected subgraph

Proved
GavrilSubtree.Chordal.theorem_2

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

characterizationclique-treep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1subtree-graph

Let GGG be a finite graph on vertex set VVV, with set of cliques μ(G)\mu(G)μ(G) and, for v∈Vv \in Vv∈V, μv(G)\mu_v(G)μv​(G) the set of cliques containing vvv. Then

G is a subtree graph  ⟺  ∃ a tree T with vertex set μ(G) such that T(μv(G)) is connected for every v∈V.G \text{ is a subtree graph} \iff \exists \text{ a tree } T \text{ with vertex set } \mu(G) \text{ such that } T(\mu_v(G)) \text{ is connected for every } v \in V.G is a subtree graph⟺∃ a tree T with vertex set μ(G) such that T(μv​(G)) is connected for every v∈V.

The right-hand side, a clique tree, is the canonical form of a subtree representation: the tree's vertices are the cliques and the subtree of vvv is the set of cliques containing vvv. Theorem 2 reduces the main theorem to constructing a clique tree for every chordal graph.

Formalization Note VVV is finite (the paper's standing assumption) but may be empty: then μ(G)={∅}\mu(G) = \{\varnothing\}μ(G)={∅} and both sides hold. Connectedness of T(μv(G))T(\mu_v(G))T(μv​(G)) includes nonemptiness, i.e. every vertex lies in a clique, which holds for finite graphs.

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

universe u

theorem theorem_2 {V : Type u} [Fintype V] (G : SimpleGraph V) :
    IsSubtreeGraph G ↔ HasCliqueTree 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 2
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