Maximal outerplanar graphs are outerplanar

Lax68.MaximalOuterplanarOuterplanar · concepts/Lax68/MaximalOuterplanarOuterplanar.lean · lax-68

proven

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

    Theorem

    Every maximal outerplanar graph is outerplanar.

    Concept map
    5 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax68.MaximalOuterplanar
    2import Lax68.Outerplanar
    3
    4/-!
    5---
    6title: Maximal outerplanar graphs are outerplanar
    7type: theorem
    8---
    9Every maximal outerplanar graph is outerplanar.
    10-/
    11
    12set_option autoImplicit false
    13
    14namespace Lax68.MaximalOuterplanarOuterplanar
    15
    16/-- Every maximal outerplanar graph is outerplanar. -/
    17axiom maximalOuterplanar_outerplanar {V : Type*} {G : SimpleGraph V} :
    18 Lax68.MaximalOuterplanar.IsMaximalOuterplanar G →
    19 Lax68.Outerplanar.IsOuterplanar G
    20
    21end Lax68.MaximalOuterplanarOuterplanar
    22
    Show Proof
    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

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

    Loading discussion…