Degeneracy
Lax825442.Degeneracy · concepts/Lax825442/Degeneracy.lean · lax-825442
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
The degeneracy of a graph is the least natural number such that every nonempty induced subgraph has a vertex of degree at most . The degree is measured within that induced subgraph.
Concept map
Lean source view on GitHub
| 1 | import Mathlib.Combinatorics.SimpleGraph.Acyclic |
| 2 | import Mathlib.Combinatorics.SimpleGraph.Finite |
| 3 | import Mathlib.Order.Lattice.Nat |
| 4 | |
| 5 | /-! |
| 6 | --- |
| 7 | title: Degeneracy |
| 8 | type: definition |
| 9 | --- |
| 10 | The degeneracy of a graph is the least natural number such that every |
| 11 | nonempty induced subgraph has a vertex of degree at most . The degree is |
| 12 | measured within that induced subgraph. |
| 13 | -/ |
| 14 | |
| 15 | namespace Lax825442.Degeneracy |
| 16 | |
| 17 | /-- Every nonempty induced subgraph has a vertex of degree at most `k`. -/ |
| 18 | def 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. -/ |
| 25 | noncomputable def degeneracy {V : Type} [Fintype V] [DecidableEq V] |
| 26 | (G : SimpleGraph V) : ℕ := |
| 27 | sInf {k | HasDegeneracyAtMost G k} |
| 28 | |
| 29 | end Lax825442.Degeneracy |
| 30 |
Builds on
none
Used by
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments