Incomparability of graph parameters
Lax825442.Incomparable · concepts/Lax825442/Incomparable.lean · lax-825442
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
Two graph parameters are incomparable if neither is bounded by a total computable nondecreasing function of the other on every finite simple graph.
Concept map
Lean source view on GitHub
| 1 | import Lax825442.DoesNotBound |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Incomparability of graph parameters |
| 6 | type: definition |
| 7 | --- |
| 8 | Two graph parameters are incomparable if neither is bounded by a total |
| 9 | computable nondecreasing function of the other on every finite simple graph. |
| 10 | -/ |
| 11 | |
| 12 | namespace Lax825442.Incomparable |
| 13 | |
| 14 | open Lax153141.GraphParameters |
| 15 | |
| 16 | /-- Neither parameter functionally bounds the other. -/ |
| 17 | def Incomparable (p q : GraphParam) : Prop := |
| 18 | (Lax825442.DoesNotBound.DoesNotBound p q) ∧ |
| 19 | (Lax825442.DoesNotBound.DoesNotBound q p) |
| 20 | |
| 21 | end Lax825442.Incomparable |
| 22 |
Builds on
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments