The pure literal rule threshold and cores in random hypergraphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 665-674

  Molloy, Michael ^a,b  

^a UNIVERSITY OF TORONTO   (Canada)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; BOUNDARY VALUE PROBLEMS; DIFFERENTIAL EQUATIONS; DIFFERENTIATION (CALCULUS); HEURISTIC METHODS; MATHEMATICAL MODELS; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; THEOREM PROVING;

BOOLEAN FORMULAE; RANDOM HYPERGRAPHS;

GRAPH THEORY;

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

References (27)

1. D. Achlioptas, P. Beame and M. Molloy, A sharp threshold in proof complexity. Proceedings of STOC 2001, 337-346. Full version to appear in J. Computer and System Sciences.
2. D. Achlioptas, P. Beame and M. Molloy, A sharp threshold in proof complexity. Proceedings of STOC 2001, 337-346. Full version to appear in J. Computer and System Sciences.
3. D. Achlioptas and M. Molloy. Analysis of a list-colouring algorithm on a random graph. Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), 204-212 (1997).
4. K. Azuma. Weighted Sums of Certain Dependent Random Variables. Tokuku Math. Journal 19 (1967), 357-367.
5. E. A. Bender and E. R. Canfield, The asymptotic number of labelled graphs with given degree, sequences. Journal of Combinatorial Theory (A) 24 (1978), 296-307.
6. B. Bollobás. The evolution of sparse graphs. In "Graph Theory and Combinatorics", editor: B. Bollobás, 35-57 (1984).
7. B. Bollobás, Martingales, Isoperimetric Inequalities and Random Graphs. Colloq. Math. Soc. Janós Bolyai 52 (1987), 113-139.
8. B. Bollobás and G. Brightwell. The width of random graph orders. The Mathematical Scientist 20, 69-90 (1995).
9. A. Broder, A. Frieze and E. Upfal. On the satisfiability and maximum satisfiability of random 3-CNF formulas. Proceedings of the 41st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 322-330 (1993).
10. V. Chvátal. Almost All Graphs With 1.44n Edges are 3-Colourable. Random Structures and Algorithms 2 (1991), 11-28.
11. V. Chvatal and E. Szemeredi. Many hard examples for resolution. Journal of the ACM 35 (1988) 759-768.
12. C. Cooper, A. Frieze, M. Molloy and B. Reed. Perfect matchings in random r-regular, s-uniform hypergraphs. Combinatorics, Probability and Computing 5 1-14 (1996).
13. P. Erd″os and A. Rényi. On the Evolution of Random Graphs. Magayr Tud. Akad. Mat. Kutato Int. Kozl. 5 (1960), 17-61.
14. J. Franco Probabilistic analysis of the pure literal heuristic for the satisfiability problem. Annals of Operations Research I (1984), 273-289.
15. A. Goerdt and M. Molloy. Analysis of edge deletion processes on random regular graphs Proceedings of Latin American Theoretical Informatics, 38-47 (2000). To appear in Theoretical Computer Science.
16. A. Goerdt and M. Molloy. Analysis of edge deletion processes on random regular graphs Proceedings of Latin American Theoretical Informatics, 38-47 (2000). To appear in Theoretical Computer Science.
17. S. Janson, T. Łuczak and A. Ruciński. Random Graphs. Wiley, New York (2000).
18. J. Kim, in preparation.
19. M. Luby, M. Mitzenmacher, and A. Shokrollahi. Analysis of random processes via and-or tree evaluation. Proceedings of SODA 1998.
20. T. Łuczak. Size and connectivity of the k-core of a random graph. Discrete Math. 91, 61-68 (1991).
21. B. Majewski, N. Wormald, G. Havas, Z. Czech. A Family of Perfect Hashing Methods. The Computer Journal 39(6), 547-554 (1996).
22. M. Mitzenmacher. Tight thresholds for the pure literal rule. Technical Note 1997-011, Digital Systems Research Center, Palo Alto, CA (1997).
23. M. Molloy. A gap between the appearance of a k-core and a k-chromatic graph. Random Structures & Algorithms 8, 159-160 (1996).
24. B. Pittel, J. Spencer and N. Wormald. Sudden emergence of a giant k-core in a random graph. J. Comb. Th. B 67, 111-151 (1996).
25. J. Plotkin and J. Rosenthal. Probabilistic analysis of the pure literal for the satisfiability problem. Abstracts of the AMS 6 (1995), p. 267.
26. J. Rosenthal, J. Plotkin and J. Franco. The probability of pure literals. Journal of Computational Logic 9 (1999), 501-513.
27. N. C. Wormald. Some Problems in the Enumeration of Labelled Graphs. Doctoral thesis, Newcastle University (1978).