On an online random k-SAT model
Random Structures & Algorithms
Delaying satisfiability for random 2SAT
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
| Hi-index | 0.00 |
Here we introduce a new model for random 2-SAT. It is well known that on the standard model there is a sharp phase transition; the probability of satisfiability quickly drops as the number of clauses exceeds the number of variables. The location of this phase transition suggests that there is a direct connection between the appearance of a giant in the corresponding $2n$-vertex graph and satisfiability. Here we show that the giant has nothing to do with satisfiability and that in fact the expected degree of a randomly chosen vertex is the important thing.