Lax Lean Archive

Draft — mutable and not usable as a dependency; its citation marks the draft state.

Lax68.Trees

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.

    Concept map

    Open claimDefinitionThis conceptRelated conceptA → B: B builds on A

    Definition

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

    Lean source view on GitHub

    1import Mathlib.Combinatorics.SimpleGraph.Acyclic
    2
    3/-!
    4---
    5title: Trees
    6type: definition
    7---
    8A tree is a connected acyclic simple graph, using mathlib's native
    9`SimpleGraph.IsTree` predicate.
    10-/
    11
    12set_option autoImplicit false
    13
    14namespace Lax68.Trees
    15
    16def IsTree {V : Type*} (G : SimpleGraph V) : Prop :=
    17 G.IsTree
    18
    19end Lax68.Trees
    20

    Builds on

    none

    Used by

    From Mathlib

    Community review

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.

    0 comments

    Loading discussion…