Skip to Navigation
Skip to Content
 
Home> Combinatorics, Probability and Computing> Vol. 17 Issue 02

 

Log In

Browse Journals

Special Sales

Cambridge Journals Digital Archive

Click here for details about our archive digitisation project. more details

2009 Journals Catalogue

Click here to download a PDF of our latest catalogue; a comprehensive guide to all of our journals. more details

CJO Now Includes:

567,269 articles from 321 leading journals.

Customize Your Search Toolbar

Combinatorics, Probability and Computing

Search

Social Bookmarking

  • Note: Abstract, PDF and HTML open in a new window

  • Editor(s):
  • Béla Bollobás, DPMMS, Cambridge, UK; University of Memphis, USA

Sort by

Previous Issue Next Issue

Table of Contents - Volume 17 - Issue 02  

  Please select Articles below or use Select All, then click the appropriate button above. Select/Deselect All:
 

Paper

 
 

An Analysis of the Height of Tries with Random Weights on the Edges

N. BROUTIN and L. DEVROYE

Combinatorics, Probability and Computing, Volume 17, Issue 02, March 2008, pp 161-202
doi:10.1017/S0963548307008796 (About doi), Published Online by Cambridge University Press 26 Nov 2007
 

On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space

ADRIAN DUMITRESCU and CSABA D. TÓTH

Combinatorics, Probability and Computing, Volume 17, Issue 02, March 2008, pp 203-224
doi:10.1017/S096354830700884X (About doi), Published Online by Cambridge University Press 07 Dec 2007
 

Regions Without Complex Zeros for Chromatic Polynomials on Graphs with Bounded Degree

ROBERTO FERNÁNDEZ and ALDO PROCACCI

Combinatorics, Probability and Computing, Volume 17, Issue 02, March 2008, pp 225-238
doi:10.1017/S0963548307008632 (About doi), Published Online by Cambridge University Press 05 Jul 2007
 

Three Counter-Examples on Semi-Graphoids

RAYMOND HEMMECKE, JASON MORTON, ANNE SHIU, BERND STURMFELS and OLIVER WIENAND

Combinatorics, Probability and Computing, Volume 17, Issue 02, March 2008, pp 239-257
doi:10.1017/S0963548307008838 (About doi), Published Online by Cambridge University Press 07 Dec 2007
 

Dismantling Sparse Random Graphs

SVANTE JANSON and ANDREW THOMASON

Combinatorics, Probability and Computing, Volume 17, Issue 02, March 2008, pp 259-264
doi:10.1017/S0963548307008802 (About doi), Published Online by Cambridge University Press 16 Nov 2007
 

A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring

H. A. KIERSTEAD and A. V. KOSTOCHKA

Combinatorics, Probability and Computing, Volume 17, Issue 02, March 2008, pp 265-270
doi:10.1017/S0963548307008619 (About doi), Published Online by Cambridge University Press 05 Jul 2007
 

On the Strong Chromatic Number of Random Graphs

PO-SHEN LOH and BENNY SUDAKOV

Combinatorics, Probability and Computing, Volume 17, Issue 02, March 2008, pp 271-286
doi:10.1017/S0963548307008607 (About doi), Published Online by Cambridge University Press 05 Jul 2007
 

Boundary Classes of Planar Graphs

VADIM LOZIN

Combinatorics, Probability and Computing, Volume 17, Issue 02, March 2008, pp 287-295
doi:10.1017/S0963548307008814 (About doi), Published Online by Cambridge University Press 27 Nov 2007
 

A Note on Freĭman's Theorem in Vector Spaces

T. SANDERS

Combinatorics, Probability and Computing, Volume 17, Issue 02, March 2008, pp 297-305
doi:10.1017/S0963548307008644 (About doi), Published Online by Cambridge University Press 05 Jul 2007
 

Tail Estimates for Sums of Variables Sampled by a Random Walk

ROY WAGNER

Combinatorics, Probability and Computing, Volume 17, Issue 02, March 2008, pp 307-316
doi:10.1017/S0963548307008772 (About doi), Published Online by Cambridge University Press 07 Dec 2007
 

Book Reviews

 
 

The Random-Cluster Model, by Geoffrey Grimmett, Springer, 2006, 377pp., £69.00/$125.00/89.95 Euros.

Hans-Otto Georgii

Combinatorics, Probability and Computing, Volume 17, Issue 02, March 2008, pp 317-318
doi:10.1017/S0963548308008924 (About doi), Published Online by Cambridge University Press 18 Feb 2008
  Please select Articles above or use Select All, then click the appropriate button below. Select/Deselect All:

Sort by

Cambridge University Press