Distance to cluster graphs

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

    Concept map
    1 concept
    100%
    DefinitionThis concept

    Lean source view on GitHub

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

    Discussion

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

    Loading discussion…