Lax Lean Archive

NP-hardness of unweighted Max Cut

Lax762056.MaxCutHardness · concepts/Lax762056/MaxCutHardness.lean · lax-762056

proven

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

    Lemma

    Deciding whether a finite simple unweighted graph has a cut of size at least kk is NP-hard (Garey, Johnson, and Stockmeyer, 1976).

    Concept map
    7 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 Lax762056.GraphProblems
    2
    3/-!
    4---
    5title: NP-hardness of unweighted Max Cut
    6type: lemma
    7---
    8Deciding whether a finite simple unweighted graph has a cut of size at
    9least kk is NP-hard (Garey, Johnson, and Stockmeyer, 1976).
    10-/
    11
    12namespace Lax762056.MaxCutHardness
    13
    14open GraphProblems
    15
    16axiom maxCut_hardness : NPHard MaxCut
    17
    18end Lax762056.MaxCutHardness
    19
    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…