Distance to cographs

Lax825442.DistanceToCograph · concepts/Lax825442/DistanceToCograph.lean · lax-825442

definition

Loading review…

Sign in with ORCID

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 distance to cographs is the minimum number of vertices whose deletion leaves a cograph.

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

    Lean source view on GitHub

    1import Lax214022.Cographs
    2import Mathlib.Combinatorics.SimpleGraph.Finite
    3import Mathlib.Order.Lattice.Nat
    4
    5/-!
    6---
    7title: Distance to cographs
    8type: definition
    9---
    10The distance to cographs is the minimum number of vertices whose deletion
    11leaves a cograph.
    12-/
    13
    14namespace Lax825442.DistanceToCograph
    15
    16/-- Minimum number of vertices whose deletion leaves a cograph. -/
    17noncomputable def distanceToCograph {V : Type} [Fintype V] [DecidableEq V]
    18 (G : SimpleGraph V) : ℕ :=
    19 sInf {k : ℕ | ∃ S : Finset V, (S.card = k) ∧
    20 (Lax214022.Cographs.IsCograph (G.induce {v | v ∉ S}))}
    21
    22end Lax825442.DistanceToCograph
    23

    Discussion

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

    Loading discussion…