Distance to complete graphs

Lax825442.DistanceToClique · concepts/Lax825442/DistanceToClique.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 complete graphs is the minimum number of vertices whose deletion leaves a complete graph.

    Concept map
    1 concept
    100%
    DefinitionThis concept

    Lean source view on GitHub

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

    Discussion

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

    Loading discussion…