Skip to Navigation
Skip to Content
 
Home> Combinatorics, Probability and Computing> Vol. 18 Issue 03

 

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:

568,935 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 18 - Issue 03  

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

Front Cover (OFC, IFC) and matter

 
 

CPC volume 18 issue 3 Cover and Front matter

Combinatorics, Probability and Computing, Volume 18, Issue 03, May 2009, pp f1-f2
doi:10.1017/S0963548309009912 (About doi), Published Online by Cambridge University Press 16 Apr 2009
 

Back Cover (IBC, OBC) and matter

 
 

CPC volume 18 issue 3 Cover and Back matter

Combinatorics, Probability and Computing, Volume 18, Issue 03, May 2009, pp b1-b4
doi:10.1017/S0963548309009924 (About doi), Published Online by Cambridge University Press 16 Apr 2009
 

Paper

 
 

Growing at a Perfect Speed

M. H. ALBERT and S. A. LINTON

Combinatorics, Probability and Computing, Volume 18, Issue 03, May 2009, pp 301-308
doi:10.1017/S0963548309009699 (About doi), Published Online by Cambridge University Press 18 Feb 2009
 

Algebraic Properties of Modulo q Complete ℓ-Wide Families

BÁLINT FELSZEGHY, GÁBOR HEGEDŰS and LAJOS RÓNYAI

Combinatorics, Probability and Computing, Volume 18, Issue 03, May 2009, pp 309-333
doi:10.1017/S0963548308009619 (About doi), Published Online by Cambridge University Press 09 Dec 2008
 

Freiman's Theorem in Finite Fields via Extremal Set Theory

BEN GREEN and TERENCE TAO

Combinatorics, Probability and Computing, Volume 18, Issue 03, May 2009, pp 335-355
doi:10.1017/S0963548309009821 (About doi), Published Online by Cambridge University Press 30 Mar 2009
 

Decision Trees and Influences of Variables Over Product Probability Spaces

HAMED HATAMI

Combinatorics, Probability and Computing, Volume 18, Issue 03, May 2009, pp 357-369
doi:10.1017/S0963548309009833 (About doi), Published Online by Cambridge University Press 30 Mar 2009
 

On the Likely Number of Solutions for the Stable Marriage Problem

CRAIG LENNON and BORIS PITTEL

Combinatorics, Probability and Computing, Volume 18, Issue 03, May 2009, pp 371-421
doi:10.1017/S0963548308009607 (About doi), Published Online by Cambridge University Press 04 Dec 2008
 

On the Difference of Expected Lengths of Minimum Spanning Trees

WENBO V. LI and XINYI ZHANG

Combinatorics, Probability and Computing, Volume 18, Issue 03, May 2009, pp 423-434
doi:10.1017/S0963548308009590 (About doi), Published Online by Cambridge University Press 30 Oct 2008
 

Triangles in Regular Graphs with Density Below One Half

ALLAN SIU LUN LO

Combinatorics, Probability and Computing, Volume 18, Issue 03, May 2009, pp 435-440
doi:10.1017/S0963548309009857 (About doi), Published Online by Cambridge University Press 30 Mar 2009
 

Simplex Stability

DHRUV MUBAYI and RESHMA RAMADURAI

Combinatorics, Probability and Computing, Volume 18, Issue 03, May 2009, pp 441-454
doi:10.1017/S0963548309009705 (About doi), Published Online by Cambridge University Press 19 Feb 2009
 

A Spectral Erdős–Stone–Bollobás Theorem

VLADIMIR NIKIFOROV

Combinatorics, Probability and Computing, Volume 18, Issue 03, May 2009, pp 455-458
doi:10.1017/S0963548309009687 (About doi), Published Online by Cambridge University Press 19 Feb 2009
  Please select Articles above or use Select All, then click the appropriate button below. Select/Deselect All:

Sort by

Cambridge University Press