Functional bounds between graph parameters
Lax825442.Bounds · concepts/Lax825442/Bounds.lean · lax-825442
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
For graph parameters and with values in the natural numbers, we write if there is a total computable nondecreasing function such that for every finite simple graph . Thus, a bound on yields a bound on . The definition includes disconnected graphs.
Concept map
Lean source view on GitHub
| 1 | import Lax153141.GraphParameters |
| 2 | import Mathlib.Order.Monotone.Basic |
| 3 | import Mathlib.Computability.Partrec |
| 4 | |
| 5 | /-! |
| 6 | --- |
| 7 | title: Functional bounds between graph parameters |
| 8 | type: definition |
| 9 | --- |
| 10 | For graph parameters and with values in the natural numbers, we write |
| 11 | if there is a total computable nondecreasing function |
| 12 | such that for every finite |
| 13 | simple graph . Thus, a bound on yields a bound on . The definition |
| 14 | includes disconnected graphs. |
| 15 | -/ |
| 16 | |
| 17 | namespace Lax825442.Bounds |
| 18 | |
| 19 | open Lax153141.GraphParameters |
| 20 | |
| 21 | /-- A computable nondecreasing function of `p` bounds `q` on every finite simple graph. -/ |
| 22 | def Bounds (p q : GraphParam) : Prop := |
| 23 | ∃ f : ℕ → ℕ, Computable f ∧ Monotone f ∧ |
| 24 | (∀ {V : Type} [Fintype V] [DecidableEq V] (G : SimpleGraph V), |
| 25 | q G ≤ f (p G)) |
| 26 | |
| 27 | end Lax825442.Bounds |
| 28 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments