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

 

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 05  

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

Paper

 
 

Sums of Dilates

BORIS BUKH

Combinatorics, Probability and Computing, Volume 17, Issue 05, September 2008, pp 627-639
doi:10.1017/S096354830800919X (About doi), Published Online by Cambridge University Press 30 Jun 2008
 

Generating All Sets With Bounded Unions

YANNICK FREIN, BENJAMIN LÉVÊQUE and ANDRÁS SEBŐ

Combinatorics, Probability and Computing, Volume 17, Issue 05, September 2008, pp 641-660
doi:10.1017/S096354830800922X (About doi), Published Online by Cambridge University Press 08 Jul 2008
 

Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations

MICHAEL FUCHS

Combinatorics, Probability and Computing, Volume 17, Issue 05, September 2008, pp 661-680
doi:10.1017/S0963548308009243 (About doi), Published Online by Cambridge University Press 06 Aug 2008
 

Projecting Difference Sets on the Positive Orthant

RON HOLZMAN, VSEVOLOD F. LEV and ROM PINCHASI

Combinatorics, Probability and Computing, Volume 17, Issue 05, September 2008, pp 681-688
doi:10.1017/S0963548308009139 (About doi), Published Online by Cambridge University Press 13 Jun 2008
 

A Dirac-Type Result on Hamilton Cycles in Oriented Graphs

LUKE KELLY, DANIELA KÜHN and DERYK OSTHUS

Combinatorics, Probability and Computing, Volume 17, Issue 05, September 2008, pp 689-709
doi:10.1017/S0963548308009218 (About doi), Published Online by Cambridge University Press 04 Jul 2008
 

Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component

RUSSELL LYONS, RON PELED and ODED SCHRAMM

Combinatorics, Probability and Computing, Volume 17, Issue 05, September 2008, pp 711-726
doi:10.1017/S0963548308009188 (About doi), Published Online by Cambridge University Press 30 Jun 2008
  Please select Articles above or use Select All, then click the appropriate button below. Select/Deselect All:

Sort by

Cambridge University Press