Lax Lean Archive

While this submission is a draft, it cannot be used by other submissions.

c-closure

Lax560391.Closure · concepts/Lax560391/Closure.lean · lax-560391

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

    The c-closure is the least natural number c for which the graph is c-closed. Complete graphs have value zero.

    Concept map
    2 concepts
    100%
    DefinitionThis conceptRelated conceptA → B: B builds on A

    Lean source view on GitHub

    1import Lax560391.CClosedGraphs
    2import Mathlib.Order.Lattice.Nat
    3
    4/-!
    5---
    6title: c-closure
    7type: definition
    8---
    9The c-closure is the least natural number c for which the graph is c-closed.
    10Complete graphs have value zero.
    11-/
    12
    13namespace Lax560391.Closure
    14
    15noncomputable def closure {V : Type} [Fintype V] [DecidableEq V]
    16 (G : SimpleGraph V) : ℕ :=
    17 sInf {c : ℕ | Lax560391.CClosedGraphs.IsCClosed G c}
    18
    19end Lax560391.Closure
    20
    Builds on
    Used by

    none

    From Mathlib

    Discussion

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

    Loading discussion…