Vertex clique cover number
Lax825442.VertexCliqueCover · concepts/Lax825442/VertexCliqueCover.lean · lax-825442
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
The vertex clique cover number is the minimum number of cliques partitioning the vertices, equivalently the chromatic number of the complement. Each color class of the complement is a clique of the original graph. The complement is finite, so converting its chromatic number to a natural number loses no information. The empty graph has value zero.
Concept map
Lean source view on GitHub
| 1 | import Mathlib.Combinatorics.SimpleGraph.Coloring.Vertex |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Vertex clique cover number |
| 6 | type: definition |
| 7 | --- |
| 8 | The vertex clique cover number is the minimum number of cliques partitioning |
| 9 | the vertices, equivalently the chromatic number of the complement. |
| 10 | Each color class of the complement is a clique of the original graph. |
| 11 | The complement is finite, so converting its chromatic number to a natural |
| 12 | number loses no information. The empty graph has value zero. |
| 13 | -/ |
| 14 | |
| 15 | namespace Lax825442.VertexCliqueCover |
| 16 | |
| 17 | /-- The vertex clique cover number, expressed as the chromatic number of the |
| 18 | complement. -/ |
| 19 | noncomputable def vertexCliqueCover {V : Type} [Fintype V] [DecidableEq V] |
| 20 | (G : SimpleGraph V) : ℕ := |
| 21 | Gᶜ.chromaticNumber.toNat |
| 22 | |
| 23 | end Lax825442.VertexCliqueCover |
| 24 | |
| 25 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments