Research Article
On a Square Packing Problem
-
- Published online by Cambridge University Press:
- 25 April 2002, pp. 113-127
-
- Article
- Export citation
The Chromatic Number of Graph Powers
-
- Published online by Cambridge University Press:
- 14 February 2002, pp. 1-10
-
- Article
- Export citation
Two Short Proofs Concerning Tree-Decompositions
-
- Published online by Cambridge University Press:
- 21 November 2002, pp. 541-547
-
- Article
- Export citation
Exact Expectations and Distributions for the Random Assignment Problem
-
- Published online by Cambridge University Press:
- 10 July 2002, pp. 217-248
-
- Article
- Export citation
Lower and Upper Bounds for the Time Constant of First-Passage Percolation
-
- Published online by Cambridge University Press:
- 09 October 2002, pp. 433-445
-
- Article
- Export citation
Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number
-
- Published online by Cambridge University Press:
- 06 September 2002, pp. 323-341
-
- Article
- Export citation
Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs
-
- Published online by Cambridge University Press:
- 25 April 2002, pp. 129-133
-
- Article
- Export citation
On the Lock-in Probability of Stochastic Approximation
-
- Published online by Cambridge University Press:
- 14 February 2002, pp. 11-20
-
- Article
- Export citation
Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
-
- Published online by Cambridge University Press:
- 12 July 2002, pp. 249-261
-
- Article
- Export citation
Triangle-Freeness is Hard to Detect
-
- Published online by Cambridge University Press:
- 21 November 2002, pp. 549-569
-
- Article
- Export citation
Permutations with Restricted Cycle Structure and an Algorithmic Application
-
- Published online by Cambridge University Press:
- 09 October 2002, pp. 447-464
-
- Article
- Export citation
Constructing Trees in Graphs whose Complement has no K2,s
-
- Published online by Cambridge University Press:
- 06 September 2002, pp. 343-347
-
- Article
- Export citation
The ‘Burnside Process’ Converges Slowly
-
- Published online by Cambridge University Press:
- 14 February 2002, pp. 21-34
-
- Article
- Export citation
A Sharp Threshold for Network Reliability
-
- Published online by Cambridge University Press:
- 09 October 2002, pp. 465-474
-
- Article
- Export citation
Convergence of the Iterated Prisoner's Dilemma Game
-
- Published online by Cambridge University Press:
- 25 April 2002, pp. 135-147
-
- Article
- Export citation
Bonferroni-Type Inequalities via Chordal Graphs
-
- Published online by Cambridge University Press:
- 06 September 2002, pp. 349-351
-
- Article
- Export citation
Packing Trees into the Complete Graph
-
- Published online by Cambridge University Press:
- 10 July 2002, pp. 263-272
-
- Article
- Export citation
Graphs without Large Complete Minors are Quasi-Random
-
- Published online by Cambridge University Press:
- 21 November 2002, pp. 571-585
-
- Article
- Export citation
Constructing Large Set Systems with Given Intersection Sizes Modulo Composite Numbers
-
- Published online by Cambridge University Press:
- 09 October 2002, pp. 475-486
-
- Article
- Export citation
A Ratio Inequality for Binary Trees and the Best Secretary
-
- Published online by Cambridge University Press:
- 25 April 2002, pp. 149-161
-
- Article
- Export citation