@article {IOPORT.05277976,
    author       = {Kravitz, David},
    title        = {Random 2-SAT does not depend on a giant.},
    year         = {2007},
    journal      = {SIAM Journal on Discrete Mathematics},
    volume       = {21},
    number       = {2},
    issn         = {0895-4801},
    pages        = {408-422},
    publisher    = {Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA},
    doi          = {10.1137/060662216},
    abstract     = {Summary: 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.},
    identifier   = {05277976},
}