Lax Lean Archive

While this submission is a draft, it cannot be used by other submissions.

Interval graphs

Lax560391.IntervalGraphs · concepts/Lax560391/IntervalGraphs.lean · lax-560391

definition

Loading review…

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

    An interval graph is a graph admitting an interval representation by nonempty closed real intervals. Empty and disconnected graphs are allowed.

    Concept map
    2 concepts; 1 descendant hidden
    100%
    DefinitionThis conceptRelated conceptA → B: B builds on A

    Lean source view on GitHub

    1import Lax560391.IntervalRepresentation
    2
    3/-!
    4---
    5title: Interval graphs
    6type: definition
    7---
    8An interval graph is a graph admitting an interval representation by
    9nonempty closed real intervals. Empty and disconnected graphs are allowed.
    10-/
    11
    12namespace Lax560391.IntervalGraphs
    13
    14def IsInterval {V : Type} (G : SimpleGraph V) : Prop :=
    15 Nonempty (Lax560391.IntervalRepresentation.IntervalRepresentation G)
    16
    17end Lax560391.IntervalGraphs
    18
    Builds on
    Used by
    From Mathlib

    none

    Discussion

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

    Loading discussion…