Chordal intersection dimension
Lax560391.ChordalIntersectionDimension · concepts/Lax560391/ChordalIntersectionDimension.lean · lax-560391
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
The minimum number of chordal supergraphs whose edge intersection is the graph. The intersection of zero factors is complete, so complete graphs have value zero.
Concept map
Lean source view on GitHub
| 1 | import Lax560391.ChordalIntersectionRepresentation |
| 2 | import Mathlib.Order.Lattice.Nat |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Chordal intersection dimension |
| 7 | type: definition |
| 8 | --- |
| 9 | The minimum number of chordal supergraphs whose edge intersection is the |
| 10 | graph. The intersection of zero factors is complete, so complete graphs have |
| 11 | value zero. |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax560391.ChordalIntersectionDimension |
| 15 | |
| 16 | /-- `G` is the intersection of `k` chordal graphs on the same vertices. |
| 17 | The distinctness guard gives the intersection of zero graphs the complete |
| 18 | graph rather than a reflexive relation. -/ |
| 19 | def HasChordalIntersectionDimensionAtMost {V : Type} |
| 20 | (G : SimpleGraph V) (k : ℕ) : Prop := |
| 21 | Nonempty (Lax560391.ChordalIntersectionRepresentation.ChordalIntersectionRepresentation G k) |
| 22 | |
| 23 | noncomputable def chordalIntersectionDimension |
| 24 | {V : Type} [Fintype V] [DecidableEq V] |
| 25 | (G : SimpleGraph V) : ℕ := |
| 26 | sInf {k | HasChordalIntersectionDimensionAtMost G k} |
| 27 | |
| 28 | end Lax560391.ChordalIntersectionDimension |
| 29 |
Used by
none
From Mathlib
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments