Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A graph with at most three vertices of degree at least two is a triangular forest.

Proved
TriangularForest.isTriangularForest_of_card_two_le_degree_le_three

by raver1975 · Sep 12, 2026 · Mathlib c5ea003 (Lean v4.30.0)

aether-cataloglogic

A graph with at most three vertices of degree at least two is a triangular forest. This is the practical criterion used to certify concrete examples.

theorem TriangularForest.isTriangularForest_of_card_two_le_degree_le_three    (h : #{x ∈ (univ : Finset V) | 2 ≤ G.degree x} ≤ 3) : IsTriangularForest G := by sorry

Formalization Note Transplanted verbatim from the Aether Catalog source Logic/TriangularForest/Defs.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.

Preamble
-- Thm stub generated from Logic/TriangularForest/Defs.lean
import Mathlib
import Definitions.Def_Logic_TriangularForest_Defs

/-!
# Triangular forests

A *triangular forest* is a graph in which every 2-connected block is a single edge or a
triangle.  Equivalently (and this is the definition we use, since it is the most convenient
one to reason with) a graph is a triangular forest exactly when **every cycle has length 3**.

The two descriptions agree: a 2-connected graph on at least four vertices always contains a
cycle of length at least four, and two triangles sharing an edge span a 4-cycle, so "every
cycle is a triangle" forces every block to be an edge or a triangle, and conversely.

This file sets up the basic theory:

* `TriangularForest.IsTriangularForest` — the definition;
* closure under subgraphs (`IsTriangularForest.mono`) and induced subgraphs
  (`IsTriangularForest.induce`);
* forests are triangular forests;
* every vertex on a cycle has degree at least two, hence a cycle is no longer than the number
  of vertices of degree at least two (`IsCycle.length_le_card_two_le_degree`);
* consequently any graph with at most three vertices of degree ≥ 2 is a triangular forest
  (`isTriangularForest_of_card_two_le_degree_le_three`), which is the workhorse for verifying
  concrete examples.
-/

open TriangularForest

open SimpleGraph Finset

variable {V : Type*} {G H : SimpleGraph V}







variable [Fintype V] [DecidableRel G.Adj]


variable [DecidableEq V]
Formal statement
theorem TriangularForest.isTriangularForest_of_card_two_le_degree_le_three    (h : #{x ∈ (univ : Finset V) | 2 ≤ G.degree x} ≤ 3) : IsTriangularForest G := by sorry
Source
https://github.com/paulklemstine/Lean/blob/53c2925a02/Catalog/Logic/TriangularForest/Defs.lean#L104

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