Add to ORKGWe 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 et al. in [3], [4]. 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 k-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 thus obtained random formula
For various random constraint satisfaction problems there is a significant gap between the largest c...
Let (Formula presented.) be the binomial random graph (Formula presented.) in the sparse regime, whi...
We consider a model for generating random k-SAT formulas, in which each literal occurs approximately...
ABSTRACT: We study a model of random graphs, where a random instance is obtained by adding random ed...
The main paradigm of smoothed analysis on graphs suggests that for any large graph G in a certain cl...
For a large number of random constraint satisfaction problems, such as random $k$-SAT and random gra...
We develop a new technique that allows us to show in a unified way that many well-known combinatoria...
We develop a new technique that allows us to show in a unified way that many well-known combinatoria...
This thesis addresses several questions in Ramsey theory and in probabilistic combinatorics. We begi...
For a large number of random constraint satisfaction problems, such as random k-SAT and random graph...
<p>This thesis addresses several questions in Ramsey theory and in probabilistic combinatorics. We b...
In this paper we introduce a general framework for proving lower bounds for various Ramsey type prob...
For a graph G with m edges let its Range of Subgraph Sizes (RSS) ρ(G) = {t: G contains a vertex-ind...
A sharp threshold for van der Waerden's theorem in random subsets, Discrete Analysis, 2016:7, 19 pp....
We show that for each r > 4, in a density range extending up to, and slightly beyond, the thresho...
For various random constraint satisfaction problems there is a significant gap between the largest c...
Let (Formula presented.) be the binomial random graph (Formula presented.) in the sparse regime, whi...
We consider a model for generating random k-SAT formulas, in which each literal occurs approximately...
ABSTRACT: We study a model of random graphs, where a random instance is obtained by adding random ed...
The main paradigm of smoothed analysis on graphs suggests that for any large graph G in a certain cl...
For a large number of random constraint satisfaction problems, such as random $k$-SAT and random gra...
We develop a new technique that allows us to show in a unified way that many well-known combinatoria...
We develop a new technique that allows us to show in a unified way that many well-known combinatoria...
This thesis addresses several questions in Ramsey theory and in probabilistic combinatorics. We begi...
For a large number of random constraint satisfaction problems, such as random k-SAT and random graph...
<p>This thesis addresses several questions in Ramsey theory and in probabilistic combinatorics. We b...
In this paper we introduce a general framework for proving lower bounds for various Ramsey type prob...
For a graph G with m edges let its Range of Subgraph Sizes (RSS) ρ(G) = {t: G contains a vertex-ind...
A sharp threshold for van der Waerden's theorem in random subsets, Discrete Analysis, 2016:7, 19 pp....
We show that for each r > 4, in a density range extending up to, and slightly beyond, the thresho...
For various random constraint satisfaction problems there is a significant gap between the largest c...
Let (Formula presented.) be the binomial random graph (Formula presented.) in the sparse regime, whi...
We consider a model for generating random k-SAT formulas, in which each literal occurs approximately...