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 of a graph is the minimum number of cliques whose vertex sets partition its vertex set. Equivalently, it is the chromatic number of the complement: each color class of the complement is a clique in the original graph. The empty graph has vertex clique cover number 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 of a graph is the minimum number of cliques |
| 9 | whose vertex sets partition its vertex set. Equivalently, it is the chromatic |
| 10 | number of the complement: each color class of the complement is a clique in |
| 11 | the original graph. The empty graph has vertex clique cover number zero. |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax825442.VertexCliqueCover |
| 15 | |
| 16 | /-- The vertex clique cover number, expressed as the chromatic number of the |
| 17 | complement. -/ |
| 18 | noncomputable def vertexCliqueCover {V : Type} [Fintype V] [DecidableEq V] |
| 19 | (G : SimpleGraph V) : ℕ := |
| 20 | Gᶜ.chromaticNumber.toNat |
| 21 | |
| 22 | end Lax825442.VertexCliqueCover |
| 23 | |
| 24 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments