Lax Lean Archive

Trees

Lax68.Trees · concepts/Lax68/Trees.lean · lax-68

definition

Loading review…

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Definition

    Tree illustration
    Tree illustration

    A tree is a connected acyclic simple graph, using mathlib's native SimpleGraph.IsTreeSimpleGraph.IsTree predicate.

    Concept map
    1 concept; 4 descendants hidden
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A

    In the paper

    Lean source view on GitHub

    1import Mathlib.Combinatorics.SimpleGraph.Acyclic
    2
    3/-!
    4---
    5title: Trees
    6type: definition
    7---
    8
    9![Tree illustration](https://raw.githubusercontent.com/lax-archive/lax-submissions/4dd917c8b9a1e181ec951b7f6fa384262af31fa9/planar-graph-classes-v4-33/assets/tree.svg "Tree illustration")
    10
    11A tree is a connected acyclic simple graph, using mathlib's native
    12`SimpleGraph.IsTree` predicate.
    13-/
    14
    15set_option autoImplicit false
    16
    17namespace Lax68.Trees
    18
    19def IsTree {V : Type*} (G : SimpleGraph V) : Prop :=
    20 G.IsTree
    21
    22end Lax68.Trees
    23
    Builds on

    none

    Used by
    From Mathlib

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…