Result 1 to 20 of 241 total
Sharp threshold for the appearance of certain spanning trees in random graphs. (English)
Random Struct. Algorithms 41, No. 4, 391-412 (2012).
1
Fast strategies in Maker-Breaker games played on random boards. (English)
Comb. Probab. Comput. 21, No. 6, 897-915 (2012).
2
Creating small subgraphs in Achlioptas processes with growing parameter. (English)
SIAM J. Discrete Math. 26, No. 2, 670-686 (2012).
3
Hitting time results for maker-breaker games. (English)
Random Struct. Algorithms 41, No. 1, 23-46 (2012).
4
Packing Hamilton cycles in random and pseudo-random hypergraphs. (English)
Random Struct. Algorithms 41, No. 1, 1-22 (2012).
5
Long cycles in subgraphs of (pseudo)random directed graphs. (English)
J. Graph Theory 70, No. 3, 284-296 (2012).
6
Hierarchy theorems for property testing. (English)
Comput. Complexity 21, No. 1, 129-192 (2012).
7
Fast embedding of spanning trees in biased maker-breaker games. (English)
Eur. J. Comb. 33, No. 6, 1086-1099 (2012).
8
Variations on cops and robbers. (English)
J. Graph Theory 69, No. 3-4, 383-402 (2012).
9
On the number of Hamilton cycles in pseudo-random graphs. (English)
Electron. J. Comb. 19, No. 1, Research Paper P25, 14 p., electronic only (2012).
10
Biased orientation games. (English)
Discrete Math. 312, No. 10, 1732-1742 (2012).
11
Packing tight Hamilton cycles in 3-uniform hypergraphs. (English)
Random Struct. Algorithms 40, No. 3, 269-300 (2012).
12
The size Ramsey number of a directed path. (English)
J. Comb. Theory, Ser. B 102, No. 3, 743-755 (2012).
13
On the resilience of hamiltonicity and optimal packing of Hamilton cycles in random graphs. (English)
SIAM J. Discrete Math. 25, No. 3, 1176-1193 (2011).
14
Hamilton cycles in random geometric graphs. (English)
Ann. Appl. Probab. 21, No. 3, 1053-1072 (2011).
15
On the resilience of hamiltonicity and optimal packing of Hamilton cycles in random graphs. (English)
Comput. Res. Repos. 2011, Article No. 1101.3099 (2011).
16
Regular induced subgraphs of a random graph. (English)
Random Struct. Algorithms 38, No. 3, 235-250 (2011).
17
Local resilience and hamiltonicity maker-breaker games in random regular graphs. (English)
Comb. Probab. Comput. 20, No. 2, 173-211 (2011).
18
The number of $F$-matchings in almost every tree is a zero residue. (English)
Electron. J. Comb. 18, No. 1, Research Paper P30, 10 p., electronic only (2011).
19
The critical bias for the Hamiltonicity game is $(1+o(1))n/\ln n$. (English)
J. Am. Math. Soc. 24, No. 1, 125-131 (2011).
20
Result 1 to 20 of 241 total
Start
Contact
Print
General Help
