Strict functional boundedness of graph parameters

Lax825442.StrictlyBounds · concepts/Lax825442/StrictlyBounds.lean · lax-825442

definition

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Definition

    A graph parameter pp strictly bounds a graph parameter qq if qq is bounded by a total computable nondecreasing function of pp on every finite simple graph, but pp admits no such bound in terms of qq.

    Concept map
    4 concepts; 2 descendants hidden
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A

    Lean source view on GitHub

    1import Lax825442.DoesNotBound
    2
    3/-!
    4---
    5title: Strict functional boundedness of graph parameters
    6type: definition
    7---
    8A graph parameter pp strictly bounds a graph parameter qq if qq is bounded
    9by a total computable nondecreasing function of pp on every finite simple
    10graph, but pp admits no such bound in terms of qq.
    11-/
    12
    13namespace Lax825442.StrictlyBounds
    14
    15open Lax153141.GraphParameters
    16
    17/-- Functional boundedness holds in one direction and fails in the reverse. -/
    18def StrictlyBounds (p q : GraphParam) : Prop :=
    19 (Lax825442.Bounds.Bounds p q) ∧
    20 (Lax825442.DoesNotBound.DoesNotBound q p)
    21
    22end Lax825442.StrictlyBounds
    23

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…