Degeneracy

Lax825442.Degeneracy · concepts/Lax825442/Degeneracy.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 degeneracy of a graph is the least natural number kk such that every nonempty induced subgraph has a vertex of degree at most kk. The degree is measured within that induced subgraph.

    Concept map
    1 concept
    100%
    DefinitionThis concept

    Lean source view on GitHub

    1import Mathlib.Combinatorics.SimpleGraph.Acyclic
    2import Mathlib.Combinatorics.SimpleGraph.Finite
    3import Mathlib.Order.Lattice.Nat
    4
    5/-!
    6---
    7title: Degeneracy
    8type: definition
    9---
    10The degeneracy of a graph is the least natural number kk such that every
    11nonempty induced subgraph has a vertex of degree at most kk. The degree is
    12measured within that induced subgraph.
    13-/
    14
    15namespace Lax825442.Degeneracy
    16
    17/-- Every nonempty induced subgraph has a vertex of degree at most `k`. -/
    18def HasDegeneracyAtMost {V : Type} [Fintype V] [DecidableEq V]
    19 (G : SimpleGraph V) (k : ℕ) : Prop :=
    20 ∀ S : Finset V, S.Nonempty →
    21 (∃ v : V, v ∈ S ∧
    22 ({u : V | u ∈ S ∧ G.Adj v u}.ncard ≤ k))
    23
    24/-- The least degeneracy bound. -/
    25noncomputable def degeneracy {V : Type} [Fintype V] [DecidableEq V]
    26 (G : SimpleGraph V) : ℕ :=
    27 sInf {k | HasDegeneracyAtMost G k}
    28
    29end Lax825442.Degeneracy
    30

    Discussion

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

    Loading discussion…