Lax Lean Archive

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

Lax68.Paths

Paths

concepts/Lax68/Paths.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 finite path graph is a graph isomorphic to the standard path graph on a positive number of vertices.

    Lean source view on GitHub

    1import Mathlib.Combinatorics.SimpleGraph.Hasse
    2
    3/-!
    4---
    5title: Paths
    6type: definition
    7---
    8A finite path graph is a graph isomorphic to the standard path graph on a
    9positive number of vertices.
    10-/
    11
    12set_option autoImplicit false
    13
    14namespace Lax68.Paths
    15
    16def HasPathShape {V : Type*} (G : SimpleGraph V) : Prop :=
    17 ∃ n : ℕ,
    18 0 < n ∧
    19 Nonempty (G ≃g SimpleGraph.pathGraph n)
    20
    21def IsPath {V : Type*} (G : SimpleGraph V) : Prop :=
    22 HasPathShape G
    23
    24end Lax68.Paths
    25

    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…