Incomparability of graph parameters

Lax825442.Incomparable · concepts/Lax825442/Incomparable.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 incomparable if neither is bounded by a total computable nondecreasing function of the other on every finite simple graph.

    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: Incomparability of graph parameters
    6type: definition
    7---
    8Two graph parameters are incomparable if neither is bounded by a total
    9computable nondecreasing function of the other on every finite simple graph.
    10-/
    11
    12namespace Lax825442.Incomparable
    13
    14open Lax153141.GraphParameters
    15
    16/-- Neither parameter functionally bounds the other. -/
    17def Incomparable (p q : GraphParam) : Prop :=
    18 (Lax825442.DoesNotBound.DoesNotBound p q) ∧
    19 (Lax825442.DoesNotBound.DoesNotBound q p)
    20
    21end Lax825442.Incomparable
    22

    Discussion

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

    Loading discussion…