Path decompositions
Lax183560.PathDecomposition · concepts/Lax183560/PathDecomposition.lean · lax-183560
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
A path decomposition of a graph is a finite sequence of vertex bags such that every vertex belongs to a bag, both endpoints of every edge belong to a common bag, and the bags containing any fixed vertex form an interval. The sequence may be empty when the graph has no vertices.
Concept map
Lean source view on GitHub
| 1 | import Mathlib.Combinatorics.SimpleGraph.Basic |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Path decompositions |
| 6 | type: definition |
| 7 | --- |
| 8 | A path decomposition of a graph is a finite sequence of vertex bags such |
| 9 | that every vertex belongs to a bag, both endpoints of every edge belong to |
| 10 | a common bag, and the bags containing any fixed vertex form an interval. |
| 11 | The sequence may be empty when the graph has no vertices. |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax183560.PathDecomposition |
| 15 | |
| 16 | /-- A path decomposition indexed by a finite linear order. -/ |
| 17 | structure PathDecomposition {V : Type} (G : SimpleGraph V) where |
| 18 | length : ℕ |
| 19 | bag : Fin length → Finset V |
| 20 | vertex_mem_bag : ∀ v : V, ∃ i, v ∈ bag i |
| 21 | edge_mem_bag : ∀ ⦃u v : V⦄, G.Adj u v → |
| 22 | ∃ i, u ∈ bag i ∧ v ∈ bag i |
| 23 | bag_indices_interval : ∀ v : V, ∀ i j l : Fin length, |
| 24 | (i ≤ j ∧ j ≤ l ∧ v ∈ bag i ∧ v ∈ bag l) → v ∈ bag j |
| 25 | |
| 26 | |
| 27 | end Lax183560.PathDecomposition |
| 28 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments