Modular-width
Lax183560.ModularWidth · concepts/Lax183560/ModularWidth.lean · lax-183560
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
The modular-width of a graph is the minimum, over all modular decompositions, of the maximum number of parts in a substitution other than a disjoint union or a complete join. Disjoint unions and complete joins do not contribute to the width. Under this convention, cographs have modular-width zero.
Concept map
Lean source view on GitHub
| 1 | import Lax183560.ModularDecomposition |
| 2 | import Mathlib.Order.Lattice.Nat |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Modular-width |
| 7 | type: definition |
| 8 | --- |
| 9 | The modular-width of a graph is the minimum, over all modular decompositions, |
| 10 | of the maximum number of parts in a substitution other than a disjoint union |
| 11 | or a complete join. Disjoint unions and complete joins do not contribute to |
| 12 | the width. Under this convention, cographs have modular-width zero. |
| 13 | -/ |
| 14 | |
| 15 | namespace Lax183560.ModularWidth |
| 16 | |
| 17 | open Lax183560.ModularDecomposition |
| 18 | |
| 19 | /-- Existence of a modular decomposition with substitution arity bounded by k. -/ |
| 20 | def HasModularWidthAtMost (V : Type) (G : SimpleGraph V) (k : ℕ) : Prop := |
| 21 | ModularDecomposition V G k |
| 22 | |
| 23 | /-- The least maximum arity of a non-union, non-join substitution. -/ |
| 24 | noncomputable def modularWidth {V : Type} [Fintype V] [DecidableEq V] |
| 25 | (G : SimpleGraph V) : ℕ := |
| 26 | sInf {k | HasModularWidthAtMost V G k} |
| 27 | |
| 28 | end Lax183560.ModularWidth |
| 29 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments