Functional equivalence of graph parameters

Lax825442.Equivalent · concepts/Lax825442/Equivalent.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

    Two graph parameters are functionally equivalent if each is bounded by a total computable nondecreasing function of the other on every finite simple graph.

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

    Lean source view on GitHub

    1import Lax825442.Bounds
    2
    3/-!
    4---
    5title: Functional equivalence of graph parameters
    6type: definition
    7---
    8Two graph parameters are functionally equivalent if each is bounded by a
    9total computable nondecreasing function of the other on every finite simple
    10graph.
    11-/
    12
    13namespace Lax825442.Equivalent
    14
    15open Lax153141.GraphParameters
    16
    17/-- Functional bounds hold in both directions. -/
    18def Equivalent (p q : GraphParam) : Prop :=
    19 (Lax825442.Bounds.Bounds p q) ∧ (Lax825442.Bounds.Bounds q p)
    20
    21end Lax825442.Equivalent
    22

    Discussion

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

    Loading discussion…