Rank-width
Lax183560.Rankwidth · concepts/Lax183560/Rankwidth.lean · lax-183560
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
The rank-width of a graph is the minimum, over all branch decompositions of its vertex set, of the maximum cut-rank. The cut-rank of a cut is the rank over the two-element field of the adjacency matrix between its two sides. The empty graph has rank-width zero.
Concept map
Lean source view on GitHub
| 1 | import Lax183560.BranchDecompositions |
| 2 | import Lax183560.CutRank |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Rank-width |
| 7 | type: definition |
| 8 | --- |
| 9 | The rank-width of a graph is the minimum, over all branch decompositions of |
| 10 | its vertex set, of the maximum cut-rank. The cut-rank of a cut is the rank |
| 11 | over the two-element field of the adjacency matrix between its two sides. |
| 12 | The empty graph has rank-width zero. |
| 13 | -/ |
| 14 | |
| 15 | namespace Lax183560.Rankwidth |
| 16 | |
| 17 | open Lax183560.BranchDecompositions Lax183560.CutRank |
| 18 | |
| 19 | /-- Existence of a vertex branch decomposition of cut-rank at most `k`. -/ |
| 20 | def HasRankwidthAtMost {V : Type} [Fintype V] [DecidableEq V] |
| 21 | (G : SimpleGraph V) (k : ℕ) : Prop := |
| 22 | IsEmpty V ∨ |
| 23 | ∃ t : BranchDecompositions.BinaryTree V, |
| 24 | t.Valid Finset.univ ∧ |
| 25 | t.cutWidth (cutRank G) ≤ k |
| 26 | |
| 27 | /-- The minimum maximum binary cut-rank. -/ |
| 28 | noncomputable def rankwidth {V : Type} [Fintype V] [DecidableEq V] |
| 29 | (G : SimpleGraph V) : ℕ := |
| 30 | sInf {k | HasRankwidthAtMost G k} |
| 31 | |
| 32 | end Lax183560.Rankwidth |
| 33 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments