Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Sparse random graph"”.

  1. Τυχαίες συνδυαστικές δομές

    … For given n,m,p we investigate if an instance of random intersection graph G (n,m,p) contains or not a Hamilton cycle. We assume that the parameter p of the model is such that p=p (n,m). We show that for the range of n,m,p which the model is not trivial or equivalent to other models the graph …

    greece Repository record for Τυχαίες συνδυαστικές δομές (opens in a new tab)

  2. On the Algebraic Proof Complexity of Constraint Satisfaction

    … calculus to refute the k-colorability of a sparse random graph sampled either from the Erdős–Rényi distribution or the uniform distribution over regular graphs. In Paper B, we show that the so-called Alekhnovich-Razborov method for proving polynomial calculus degree lower bounds also yields …

    lund Repository record for On the Algebraic Proof Complexity of Constraint Satisfaction (opens in a new tab) Download PDF for On the Algebraic Proof Complexity of Constraint Satisfaction (opens in a new tab)