Edge clique cover number
Lax560391.EdgeCliqueCover · concepts/Lax560391/EdgeCliqueCover.lean · lax-560391
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
An edge clique cover is a family of vertex cliques such that every graph edge has both endpoints in at least one family member. Its number is the minimum size of such a family. An edgeless graph has edge clique cover number zero.
Concept map
Lean source view on GitHub
| 1 | import Lax560391.EdgeCliqueCovering |
| 2 | import Mathlib.Order.Lattice.Nat |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Edge clique cover number |
| 7 | type: definition |
| 8 | --- |
| 9 | An edge clique cover is a family of vertex cliques such that every graph edge |
| 10 | has both endpoints in at least one family member. Its number is the minimum |
| 11 | size of such a family. An edgeless graph has edge clique cover number zero. |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax560391.EdgeCliqueCover |
| 15 | |
| 16 | /-- `k` indexed cliques cover every edge of `G`. Repeated or empty cliques |
| 17 | are harmless because the minimum index count is taken. -/ |
| 18 | def HasEdgeCliqueCoverAtMost {V : Type} [DecidableEq V] |
| 19 | (G : SimpleGraph V) (k : ℕ) : Prop := |
| 20 | Nonempty (Lax560391.EdgeCliqueCovering.EdgeCliqueCovering G k) |
| 21 | |
| 22 | noncomputable def edgeCliqueCover {V : Type} [Fintype V] [DecidableEq V] |
| 23 | (G : SimpleGraph V) : ℕ := |
| 24 | sInf {k | HasEdgeCliqueCoverAtMost G k} |
| 25 | |
| 26 | end Lax560391.EdgeCliqueCover |
| 27 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments