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

 

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 06  

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

Paper

 
 

Coloured Loop-Erased Random Walk on the Complete Graph

JOMY ALAPPATTU and JIM PITMAN

Combinatorics, Probability and Computing, Volume 17, Issue 06, November 2008, pp 727-740
doi:10.1017/S0963548308009115 (About doi), Published Online by Cambridge University Press 08 Sep 2008
 

B2[ g] Sets and a Conjecture of Schinzel and Schmidt

JAVIER CILLERUELO and CARLOS VINUESA

Combinatorics, Probability and Computing, Volume 17, Issue 06, November 2008, pp 741-747
doi:10.1017/S0963548308009450 (About doi), Published Online by Cambridge University Press 06 Oct 2008
 

Bounds For The Real Zeros of Chromatic Polynomials

F. M. DONG and K. M. KOH

Combinatorics, Probability and Computing, Volume 17, Issue 06, November 2008, pp 749-759
doi:10.1017/S0963548308009449 (About doi), Published Online by Cambridge University Press 06 Oct 2008
 

Dobrushin Conditions and Systematic Scan

MARTIN DYER, LESLIE ANN GOLDBERG and MARK JERRUM

Combinatorics, Probability and Computing, Volume 17, Issue 06, November 2008, pp 761-779
doi:10.1017/S0963548308009437 (About doi), Published Online by Cambridge University Press 06 Oct 2008
 

Winning Fast in Sparse Graph Construction Games

OHAD N. FELDHEIM and MICHAEL KRIVELEVICH

Combinatorics, Probability and Computing, Volume 17, Issue 06, November 2008, pp 781-791
doi:10.1017/S0963548308009401 (About doi), Published Online by Cambridge University Press 07 Oct 2008
 

A Weighted Generalization of Gao's n + D − 1 Theorem

YAHYA O. HAMIDOUNE

Combinatorics, Probability and Computing, Volume 17, Issue 06, November 2008, pp 793-798
doi:10.1017/S0963548308009425 (About doi), Published Online by Cambridge University Press 09 Oct 2008
 

Individual Displacements in Hashing with Coalesced Chains

SVANTE JANSON

Combinatorics, Probability and Computing, Volume 17, Issue 06, November 2008, pp 799-814
doi:10.1017/S0963548308009395 (About doi), Published Online by Cambridge University Press 06 Oct 2008
 

A Weakening of the Odd Hadwiger's Conjecture

KEN-ICHI KAWARABAYASHI

Combinatorics, Probability and Computing, Volume 17, Issue 06, November 2008, pp 815-821
doi:10.1017/S0963548308009462 (About doi), Published Online by Cambridge University Press 20 Oct 2008
 

When is an Almost Monochromatic K4 Guaranteed?

ALEXANDR KOSTOCHKA and DHRUV MUBAYI

Combinatorics, Probability and Computing, Volume 17, Issue 06, November 2008, pp 823-830
doi:10.1017/S0963548308009413 (About doi), Published Online by Cambridge University Press 20 Oct 2008
 

The Hitting Time for the Height of a Random Recursive Tree

THOMAS M. LEWIS

Combinatorics, Probability and Computing, Volume 17, Issue 06, November 2008, pp 831-835
doi:10.1017/S0963548308009486 (About doi), Published Online by Cambridge University Press 20 Oct 2008
 

On a Form of Coordinate Percolation

ELIZABETH R. MOSEMAN and PETER WINKLER

Combinatorics, Probability and Computing, Volume 17, Issue 06, November 2008, pp 837-845
doi:10.1017/S0963548308009474 (About doi), Published Online by Cambridge University Press 20 Oct 2008
  Please select Articles above or use Select All, then click the appropriate button below. Select/Deselect All:

Sort by

Cambridge University Press