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