Works matching IS 10429832 AND DT 2014 AND VI 45 AND IP 3
Results: 8
Sets that are connected in two random graphs.
- Published in:
- Random Structures & Algorithms, 2014, v. 45, n. 3, p. 498, doi. 10.1002/rsa.20491
- By:
- Publication type:
- Article
For most graphs H, most H-free graphs have a linear homogeneous set.
- Published in:
- Random Structures & Algorithms, 2014, v. 45, n. 3, p. 343, doi. 10.1002/rsa.20488
- By:
- Publication type:
- Article
Connectivity of inhomogeneous random graphs.
- Published in:
- Random Structures & Algorithms, 2014, v. 45, n. 3, p. 408, doi. 10.1002/rsa.20490
- By:
- Publication type:
- Article
The diamond-free process.
- Published in:
- Random Structures & Algorithms, 2014, v. 45, n. 3, p. 513, doi. 10.1002/rsa.20517
- By:
- Publication type:
- Article
The mixing time of the giant component of a random graph.
- Published in:
- Random Structures & Algorithms, 2014, v. 45, n. 3, p. 383, doi. 10.1002/rsa.20539
- By:
- Publication type:
- Article
On the concentration of the number of solutions of random satisfiability formulas.
- Published in:
- Random Structures & Algorithms, 2014, v. 45, n. 3, p. 362, doi. 10.1002/rsa.20501
- By:
- Publication type:
- Article
On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three.
- Published in:
- Random Structures & Algorithms, 2014, v. 45, n. 3, p. 443, doi. 10.1002/rsa.20482
- By:
- Publication type:
- Article
Stochastic service systems, random interval graphs and search algorithms.
- Published in:
- Random Structures & Algorithms, 2014, v. 45, n. 3, p. 421, doi. 10.1002/rsa.20485
- By:
- Publication type:
- Article