A note on random 2-SAT with prescribed literal degrees

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 316-320

  Cooper, Colin ^a   Frieze, Alan ^b   Sorkin, Gregory B ^c  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

DEGREE SEQUENCE; DISCRETE MATHEMATICS; GIANT COMPONENTS; PRESCRIBED DEGREE SEQUENCE; RANDOM GRAPHS; SATISFIABILITY;

FORMAL LOGIC;

EID: 84968765246     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. B. Aspvall, M.F. Plass and R.E. Tarjan, A linear time algorithm for testing the truth of certain quantified boolean formulas, Information Processing Letters 8 (1979) 121-123.
2. B. Bollobas, A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, European Journal of Combinatorics 1 (1980) 311-316.
3. B. Bollobas, Christian Borgs, Jennifer Chayes, J.H. Kim, and D.B. Wilson, The scaling window of the 2-SAT transition, Random Structures and Algorithms (2001) 201-256.
4. V. Chvatal and B. Reed, Mick gets some (the odds are on his side), Proceedings of the 33rd Annual IEEE Symposium on the Foundations of Computer Science (1992) 620-627.
5. C. Cooper, A.M. Frieze and B. Reed, Random regular graphs of non-constant degree: connectivity and Hamilton cycles, to appear.
6. C. Cooper, A.M. Frieze, B. Reed and O. Riordan, Random regular graphs of non-constant degree: independence and chromatic number, to appear.
7. W. Fernandez de la Vega, On random 2-SAT, manuscript 1992.
8. A. Goerdt, A threshold for unsatisnability, Journal of Computer and System Sciences 33 (1996) 469-486.
9. M. Molloy and B. Reed, The size of the giant component of a random graph with a given degree sequence, Combinatorics, Probability and Computing 7 (1998) 295-305.
10. B.D. McKay, Asymptotics for symmetric 0-1 matrices with prescribed row sums, Ars Combinatoria 19A (1985) 15-26.
11. B.D. McKay and N.C. Wormald, Asymptotic enumeration by degree sequence of graphs with degree O(n1/2), Combinatorica 11 (1991) 369-382.
12. Y. Verhoeven, Random 2-SAT and unsatisnability, Information Processing Letters 72 (1999) 119-123.