On the size of minimal unsatisfiable formulas

Details On the size of minimal unsatisfiable formulas On the size of minimal unsatisfiable formulas

2008-11-04

arxiv.org/abs/0811.0427v1

Mathematics

Combinatorics

4 pages

Scientific paper

An unsatisfiable formula is called minimal if it becomes satisfiable whenever any of its clauses are removed. We construct minimal unsatisfiable $k$-SAT formulas with $\Omega(n^k)$ clauses for $k \geq 3$, thereby negatively answering a question of Rosenfeld. This should be compared to the result of Lov\'asz which asserts that a critically 3-chromatic $k$-uniform hypergraph can have at most $\binom{n}{k-1}$ edges.

Affiliated with

Also associated with

No associations

Rating

On the size of minimal unsatisfiable formulas does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the size of minimal unsatisfiable formulas, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the size of minimal unsatisfiable formulas will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-183798