Found: 9
Select item for more details and to access through your institution.
On covering by translates of a set.
- Published in:
- Random Structures & Algorithms, 2011, v. 38, n. 1/2, p. 33, doi. 10.1002/rsa.20346
- By:
- Publication type:
- Article
Excluding induced subgraphs: Critical graphs.
- Published in:
- Random Structures & Algorithms, 2011, v. 38, n. 1/2, p. 100, doi. 10.1002/rsa.20353
- By:
- Publication type:
- Article
Local resilience of almost spanning trees in random graphs.
- Published in:
- Random Structures & Algorithms, 2011, v. 38, n. 1/2, p. 121, doi. 10.1002/rsa.20345
- By:
- Publication type:
- Article
Equivalence of a random intersection graph and G( n, p).
- Published in:
- Random Structures & Algorithms, 2011, v. 38, n. 1/2, p. 205, doi. 10.1002/rsa.20356
- By:
- Publication type:
- Article
Dependent random choice.
- Published in:
- Random Structures & Algorithms, 2011, v. 38, n. 1/2, p. 68, doi. 10.1002/rsa.20344
- By:
- Publication type:
- Article
Random unlabelled graphs containing few disjoint cycles.
- Published in:
- Random Structures & Algorithms, 2011, v. 38, n. 1/2, p. 174, doi. 10.1002/rsa.20355
- By:
- Publication type:
- Article
Ramsey games with giants.
- Published in:
- Random Structures & Algorithms, 2011, v. 38, n. 1/2, p. 1, doi. 10.1002/rsa.20343
- By:
- Publication type:
- Article
Nonrepetitive list colourings of paths.
- Published in:
- Random Structures & Algorithms, 2011, v. 38, n. 1/2, p. 162, doi. 10.1002/rsa.20347
- By:
- Publication type:
- Article
Highly nonrepetitive sequences: Winning strategies from the local lemma.
- Published in:
- Random Structures & Algorithms, 2011, v. 38, n. 1/2, p. 140, doi. 10.1002/rsa.20354
- By:
- Publication type:
- Article