Lax Lean Archive

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

Lax68.Triangles

Triangles

concepts/Lax68/Triangles.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 triangle is a finite complete graph on exactly three vertices.

    Lean source view on GitHub

    1import Mathlib.Combinatorics.SimpleGraph.Maps
    2
    3/-!
    4---
    5title: Triangles
    6type: definition
    7---
    8A triangle is a finite complete graph on exactly three vertices.
    9-/
    10
    11set_option autoImplicit false
    12
    13namespace Lax68.Triangles
    14
    15def IsTriangle {V : Type*} (G : SimpleGraph V) : Prop :=
    16 Nonempty (G ≃g SimpleGraph.completeGraph (Fin 3))
    17
    18end Lax68.Triangles
    19

    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…