Volume 18; Issue 1

Random Structures & Algorithms

Volume 18; Issue 1
1

Coupling vs. conductance for the Jerrum–Sinclair chain

V.S. Anil Kumar, H. Ramesh
Journal:
Random Structures & Algorithms
Year:
2001
Language:
english
File:
PDF, 149 KB
english, 2001
3

Bisecting sparse random graphs

Malwina J. Luczak, Colin McDiarmid
Journal:
Random Structures & Algorithms
Year:
2001
Language:
english
File:
PDF, 94 KB
english, 2001
4

Compound Poisson approximations of subgraph counts in random graphs

Dudley Stark
Journal:
Random Structures & Algorithms
Year:
2001
Language:
english
File:
PDF, 198 KB
english, 2001
5

Random maximal H-free graphs

Deryk Osthus, Anusch Taraz
Journal:
Random Structures & Algorithms
Year:
2001
Language:
english
File:
PDF, 197 KB
english, 2001
6

Hamilton cycles in the union of random permutations

Alan Frieze
Journal:
Random Structures & Algorithms
Year:
2001
Language:
english
File:
PDF, 124 KB
english, 2001
7

The union of two random permutations does not have a directed Hamilton cycle

Colin Cooper
Journal:
Random Structures & Algorithms
Year:
2001
Language:
english
File:
PDF, 66 KB
english, 2001