Vertex clique cover number

Lax825442.VertexCliqueCover · concepts/Lax825442/VertexCliqueCover.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 vertex clique cover number of a graph is the minimum number of cliques whose vertex sets partition its vertex set. Equivalently, it is the chromatic number of the complement: each color class of the complement is a clique in the original graph. The empty graph has vertex clique cover number zero.

    Concept map
    1 concept
    100%
    DefinitionThis concept

    Lean source view on GitHub

    1import Mathlib.Combinatorics.SimpleGraph.Coloring.Vertex
    2
    3/-!
    4---
    5title: Vertex clique cover number
    6type: definition
    7---
    8The vertex clique cover number of a graph is the minimum number of cliques
    9whose vertex sets partition its vertex set. Equivalently, it is the chromatic
    10number of the complement: each color class of the complement is a clique in
    11the original graph. The empty graph has vertex clique cover number zero.
    12-/
    13
    14namespace Lax825442.VertexCliqueCover
    15
    16/-- The vertex clique cover number, expressed as the chromatic number of the
    17complement. -/
    18noncomputable def vertexCliqueCover {V : Type} [Fintype V] [DecidableEq V]
    19 (G : SimpleGraph V) : ℕ :=
    20 Gᶜ.chromaticNumber.toNat
    21
    22end Lax825442.VertexCliqueCover
    23
    24
    Builds on

    none

    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…