Distance to cographs
Lax825442.DistanceToCograph · concepts/Lax825442/DistanceToCograph.lean · lax-825442
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
The distance to cographs is the minimum number of vertices whose deletion leaves a cograph.
Concept map
Lean source view on GitHub
| 1 | import Lax214022.Cographs |
| 2 | import Mathlib.Combinatorics.SimpleGraph.Finite |
| 3 | import Mathlib.Order.Lattice.Nat |
| 4 | |
| 5 | /-! |
| 6 | --- |
| 7 | title: Distance to cographs |
| 8 | type: definition |
| 9 | --- |
| 10 | The distance to cographs is the minimum number of vertices whose deletion |
| 11 | leaves a cograph. |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax825442.DistanceToCograph |
| 15 | |
| 16 | /-- Minimum number of vertices whose deletion leaves a cograph. -/ |
| 17 | noncomputable def distanceToCograph {V : Type} [Fintype V] [DecidableEq V] |
| 18 | (G : SimpleGraph V) : ℕ := |
| 19 | sInf {k : ℕ | ∃ S : Finset V, (S.card = k) ∧ |
| 20 | (Lax214022.Cographs.IsCograph (G.induce {v | v ∉ S}))} |
| 21 | |
| 22 | end Lax825442.DistanceToCograph |
| 23 |
Builds on
Used by
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments