Result 1 to 20 of 475 total
Asymptotic normality of the size of the giant component in a random hypergraph. (English)
Random Struct. Algorithms 41, No. 4, 441-450 (2012).
1
Graph bootstrap percolation. (English)
Random Struct. Algorithms 41, No. 4, 413-440 (2012).
2
Walks and paths in trees. (English)
J. Graph Theory 70, No. 1, 54-66 (2012).
3
Linear algebra and bootstrap percolation. (English)
J. Comb. Theory, Ser. A 119, No. 6, 1328-1335 (2012).
4
Degree powers in graphs: the Erdős-Stone theorem. (English)
Comb. Probab. Comput. 21, No. 1-2, 89-105 (2012).
5
Critical probabilities of 1-independent percolation models. (English)
Comb. Probab. Comput. 21, No. 1-2, 11-22 (2012).
6
Asymptotic normality of the size of the giant component via a random walk. (English)
J. Comb. Theory, Ser. B 102, No. 1, 53-61 (2012).
7
Asymptotic normality of the size of the giant component via a random walk (English)
J. Comb. Theory, Ser. B 102, No. 1, 53-61 (2012).
8
Daisies and other Turán problems. (English)
Comb. Probab. Comput. 20, No. 5, 743-747 (2011).
9
Cover-decomposition and polychromatic numbers. (English)
Demetrescu, Camil (ed.) et al., Algorithms ‒ ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 799-810 (2011).
10
Sparse graphs: metrics and random models. (English)
Random Struct. Algorithms 39, No. 1, 1-38 (2011).
11
Hamilton cycles in random geometric graphs. (English)
Ann. Appl. Probab. 21, No. 3, 1053-1072 (2011).
12
Multi-path routing metrics for reliable wireless mesh routing topologies. (English)
Comput. Res. Repos. 2011, Article No. 1103.5957 (2011).
13
Energy-latency tradeoff for in-network function computation in random networks. (English)
Comput. Res. Repos. 2011, Article No. 1101.0858 (2011).
14
Sparse random graphs with clustering. (English)
Random Struct. Algorithms 38, No. 3, 269-323 (2011).
15
Intersections of graphs. (English)
J. Graph Theory 66, No. 4, 261-282 (2011).
16
Shadows of ordered graphs. (English)
J. Comb. Theory, Ser. A 118, No. 3, 729-747 (2011).
17
The structure of almost all graphs in a hereditary property. (English)
J. Comb. Theory, Ser. B 101, No. 2, 85-110 (2011).
18
The fine structure of octahedron-free graphs. (English)
J. Comb. Theory, Ser. B 101, No. 2, 67-84 (2011).
19
Large joints in graphs. (English)
Eur. J. Comb. 32, No. 1, 33-44 (2011).
20
Result 1 to 20 of 475 total
Start
Contact
Print
General Help
