On smoothed analysis in dense graphs and formulas

Michael Krivelevich, Benny Sudakov, Prasad Tetali

Research output: Contribution to journalArticlepeer-review

Abstract

We study a model of random graphs, where a random instance is obtained by adding random edges to a large graph of a given density. The research on this model has been started by Bohman and colleagues (Random Struct Algor 22 (2003), 33-42; Random Struct Algor 24 (2004), 105-117). Here we obtain a sharp threshold for the appearance of a fixed subgraph and for certain Ramsey properties. We also consider a related model of random &-SAT formulas, where an instance is obtained by adding random k-clauses to a fixed formula with a given number of clauses, and derive tight bounds for the non-satisfiability of the thus-obtained random formula.

Original languageEnglish
Pages (from-to)180-193
Number of pages14
JournalRandom Structures and Algorithms
Volume29
Issue number2
DOIs
StatePublished - Sep 2006

Fingerprint

Dive into the research topics of 'On smoothed analysis in dense graphs and formulas'. Together they form a unique fingerprint.

Cite this