Lax Lean Archive

Draft — mutable and not usable as a dependency; its citation marks the draft state.

Lax68.MaximalOuterplanar

Maximal outerplanar graphs

concepts/Lax68/MaximalOuterplanar.lean · lax-68

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.

    Concept map

    Proven claimOpen claimDefinitionThis conceptRelated conceptA → B: B builds on A

    Definition

    An outerplanar graph is maximal outerplanar when no edge can be added between its existing vertices while preserving outerplanarity.

    Lean source view on GitHub

    1import Lax68.Outerplanar
    2
    3/-!
    4---
    5title: Maximal outerplanar graphs
    6type: definition
    7---
    8An outerplanar graph is maximal outerplanar when no edge can be added between
    9its existing vertices while preserving outerplanarity.
    10-/
    11
    12set_option autoImplicit false
    13
    14namespace Lax68.MaximalOuterplanar
    15
    16def IsMaximalOuterplanar {V : Type*}
    17 (G : SimpleGraph V) : Prop :=
    18 Outerplanar.IsOuterplanar G ∧
    19 ∀ H : SimpleGraph V,
    20 G < H →
    21 ¬ Outerplanar.IsOuterplanar H
    22
    23end Lax68.MaximalOuterplanar
    24

    Builds on

    Used by

    From Mathlib

    none

    Community review

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.

    0 comments

    Loading discussion…