Cochromatic number
Lax560391.CochromaticNumber · concepts/Lax560391/CochromaticNumber.lean · lax-560391
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
The cochromatic number is the least number of parts in a vertex partition where each part induces either a clique or an independent set. Parts need not be graph modules. The empty graph has cochromatic number zero.
Concept map
Lean source view on GitHub
| 1 | import Lax560391.CochromaticPartition |
| 2 | import Mathlib.Order.Lattice.Nat |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Cochromatic number |
| 7 | type: definition |
| 8 | --- |
| 9 | The cochromatic number is the least number of parts in a vertex partition |
| 10 | where each part induces either a clique or an independent set. Parts need not |
| 11 | be graph modules. The empty graph has cochromatic number zero. |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax560391.CochromaticNumber |
| 15 | |
| 16 | /-- A partition into at most `k` cliques or independent sets. Empty labels |
| 17 | are allowed and do not affect the minimum. -/ |
| 18 | def HasCochromaticNumberAtMost {V : Type} (G : SimpleGraph V) (k : ℕ) : Prop := |
| 19 | Nonempty (Lax560391.CochromaticPartition.CochromaticPartition G k) |
| 20 | |
| 21 | noncomputable def cochromaticNumber {V : Type} [Fintype V] [DecidableEq V] |
| 22 | (G : SimpleGraph V) : ℕ := |
| 23 | sInf {k | HasCochromaticNumberAtMost G k} |
| 24 | |
| 25 | end Lax560391.CochromaticNumber |
| 26 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments