Graph Theory37 sections · 1633 units
Open in Course

Giant Pizza - Analysis

Recognizing the 2-SAT pattern.

Pattern recognition:

  • Boolean variables: each topping is either included or not
  • Constraints: "at least one of these two" = disjunction
  • Two preferences per person = exactly 22 literals per clause

This is textbook 22-SAT.

Translation:

  • "I want xx" = literal xx
  • "I don't want xx" = literal ¬x\neg x
  • "At least one of aa or bb" = clause (ab)(a \lor b)

Build the implication graph and check satisfiability.