3sat_3_occurrences_exactly3 (521B)
1 # 3SAT 3 occurrences exactly3 2 3 [3SAT] with each clause having size exactly 3 and at most 3 occurrences of each variable 4 5 - 3-SAT with exactly 3 literals par clause and exactly 3 occurrences of each variable is always satisfiable by [halls_theorem] 6 - so the same extends if you have exactly 3 literals per clause and at most 3 occurrences per variable, as you can complete the smaller clauses to clauses of size 3 7 8 Does not generalize if clauses can have size <3, cf [3SAT_3_occurrences_atmost3] 9 10 Up: [3sat_3_occurrences]