Arboricity
Lax825442.Arboricity · concepts/Lax825442/Arboricity.lean · lax-825442
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
The arboricity of a graph is the minimum number of forests whose edge sets partition its edge set. An edgeless graph has arboricity zero.
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: Arboricity |
| 8 | type: definition |
| 9 | --- |
| 10 | The arboricity of a graph is the minimum number of forests whose edge sets |
| 11 | partition its edge set. An edgeless graph has arboricity zero. |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax825442.Arboricity |
| 15 | |
| 16 | /-- An assignment of graph edges to `k` classes, each inducing a forest. -/ |
| 17 | def HasArboricityAtMost {V : Type} [Fintype V] [DecidableEq V] |
| 18 | (G : SimpleGraph V) (k : ℕ) : Prop := |
| 19 | ∃ color : G.edgeSet → Fin k, |
| 20 | (∀ i : Fin k, |
| 21 | (G.deleteEdges {e : Sym2 V | ∃ h : e ∈ G.edgeSet, |
| 22 | color ⟨e, h⟩ ≠ i}).IsAcyclic) |
| 23 | |
| 24 | /-- The minimum number of forests partitioning the edges. -/ |
| 25 | noncomputable def arboricity {V : Type} [Fintype V] [DecidableEq V] |
| 26 | (G : SimpleGraph V) : ℕ := |
| 27 | sInf {k | HasArboricityAtMost G k} |
| 28 | |
| 29 | end Lax825442.Arboricity |
| 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