Strict functional boundedness of graph parameters
Lax825442.StrictlyBounds · concepts/Lax825442/StrictlyBounds.lean · lax-825442
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
A graph parameter strictly bounds a graph parameter if is bounded by a total computable nondecreasing function of on every finite simple graph, but admits no such bound in terms of .
Concept map
Lean source view on GitHub
| 1 | import Lax825442.DoesNotBound |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Strict functional boundedness of graph parameters |
| 6 | type: definition |
| 7 | --- |
| 8 | A graph parameter strictly bounds a graph parameter if is bounded |
| 9 | by a total computable nondecreasing function of on every finite simple |
| 10 | graph, but admits no such bound in terms of . |
| 11 | -/ |
| 12 | |
| 13 | namespace Lax825442.StrictlyBounds |
| 14 | |
| 15 | open Lax153141.GraphParameters |
| 16 | |
| 17 | /-- Functional boundedness holds in one direction and fails in the reverse. -/ |
| 18 | def StrictlyBounds (p q : GraphParam) : Prop := |
| 19 | (Lax825442.Bounds.Bounds p q) ∧ |
| 20 | (Lax825442.DoesNotBound.DoesNotBound q p) |
| 21 | |
| 22 | end Lax825442.StrictlyBounds |
| 23 |
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