Chromatic number

Lax825442.ChromaticNumber · concepts/Lax825442/ChromaticNumber.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 chromatic number of a graph is the minimum number of colors needed for a proper vertex coloring.

    Concept map
    1 concept
    100%
    DefinitionThis concept

    Lean source view on GitHub

    1import Mathlib.Combinatorics.SimpleGraph.Coloring.Vertex
    2
    3/-!
    4---
    5title: Chromatic number
    6type: definition
    7---
    8The chromatic number of a graph is the minimum number of colors needed for a
    9proper vertex coloring.
    10-/
    11
    12namespace Lax825442.ChromaticNumber
    13
    14/-- The natural-valued chromatic number of a finite graph. -/
    15noncomputable def chromaticNumber {V : Type} [Fintype V] [DecidableEq V]
    16 (G : SimpleGraph V) : ℕ :=
    17 G.chromaticNumber.toNat
    18
    19end Lax825442.ChromaticNumber
    20
    21
    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…