Vertex-cover number
Lax825442.VertexCover · concepts/Lax825442/VertexCover.lean · lax-825442
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
A vertex cover is a set of vertices that meets every edge. The vertex-cover number is the minimum size of a vertex cover.
Concept map
Lean source view on GitHub
| 1 | import Mathlib.Combinatorics.SimpleGraph.VertexCover |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Vertex-cover number |
| 6 | type: definition |
| 7 | --- |
| 8 | A vertex cover is a set of vertices that meets every edge. The vertex-cover |
| 9 | number is the minimum size of a vertex cover. |
| 10 | -/ |
| 11 | |
| 12 | namespace Lax825442.VertexCover |
| 13 | |
| 14 | /-- The natural-valued vertex-cover number of a finite graph. -/ |
| 15 | noncomputable def vertexCover {V : Type} [Fintype V] [DecidableEq V] |
| 16 | (G : SimpleGraph V) : ℕ := |
| 17 | G.vertexCoverNum.toNat |
| 18 | |
| 19 | end Lax825442.VertexCover |
| 20 | |
| 21 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments