Thresholds for colourability and satisfiability in random graphs and boolean formulae

No abstract is available for this paper.

• Publication year

  2001

• Venue

  Unknown venue

• Publication date

  2001-07-05

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1017/CBO9780511721328.009
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• No references are available for this paper.

• The Freezing Threshold for k-Colourings of a Random Graph

  2018cites this paper
• The freezing threshold for k-colourings of a random graph

  2012cites this paper
• Structure of random r-SAT below the pure literal threshold

  2010cites this paper
• How to prove conditional randomness using the Principle of Deferred Decisions

  2008cites this paper
• Threshold Phenomena in Random Constraint Satisfaction Problems

  2008cites this paper
• Universality in two-dimensional enhancement percolation

  2008cites this paper
• Sharp thresholds for constraint satisfaction problems and homomorphisms

  2006cites this paper
• Proving Conditional Randomness using The Principle of Deferred Decisions

  2006cites this paper
• Satisfiability Decay along Conjunctions of Pseudo-Random Clauses

  2006influential citation
• Research problems from the 18th British Combinatorial Conference

  2003cites this paper
• Upper bounds on the non-3-colourability threshold of random graphs

  2002cites this paper
• Linear phase transition in random linear constraint satisfaction problems

  2002cites this paper
• Coloring Random Graphs — an Algorithmic Perspective

  2002cites this paper
• Problems from the Eighteenth British Combinatorial Conference

  2001cites this paper