Skip to Navigation
Skip to Content
 
Home> Combinatorics, Probability and Computing> Vol. 18 Special 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:

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 - Special Issue 05 (New Directions in Algorithms, Combinatorics and Optimization)  

Editors: Graham Brightwell

  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 5 Cover and Front matter

Combinatorics, Probability and Computing, Volume 18, Special Issue 05, September 2009, pp f1-f3
doi:10.1017/S0963548309990393 (About doi), Published Online by Cambridge University Press 20 Aug 2009
 

Back Cover (IBC, OBC) and matter

 
 

CPC volume 18 issue 5 Cover and Back matter

Combinatorics, Probability and Computing, Volume 18, Special Issue 05, September 2009, pp b1-b4
doi:10.1017/S096354830999040X (About doi), Published Online by Cambridge University Press 20 Aug 2009
 

Introduction

 
 

Introduction

Graham Brightwell

Combinatorics, Probability and Computing, Volume 18, Special Issue 05, September 2009, pp 617-618
doi:10.1017/S0963548309990411 (About doi), Published Online by Cambridge University Press 20 Aug 2009
 

Paper

 
 

Economical Elimination of Cycles in the Torus

NOGA ALON

Combinatorics, Probability and Computing, Volume 18, Special Issue 05, September 2009, pp 619-627
doi:10.1017/S0963548309009997 (About doi), Published Online by Cambridge University Press 21 May 2009
 

Erdős–Ko–Rado in Random Hypergraphs

JÓZSEF BALOGH, TOM BOHMAN and DHRUV MUBAYI

Combinatorics, Probability and Computing, Volume 18, Special Issue 05, September 2009, pp 629-646
doi:10.1017/S0963548309990253 (About doi), Published Online by Cambridge University Press 09 Jul 2009
 

The Degree Sequence of Random Graphs from Subcritical Classes

NICLA BERNASCONI, KONSTANTINOS PANAGIOTOU and ANGELIKA STEGER

Combinatorics, Probability and Computing, Volume 18, Special Issue 05, September 2009, pp 647-681
doi:10.1017/S0963548309990368 (About doi), Published Online by Cambridge University Press 20 Aug 2009
 

A Note on Universal and Canonically Coloured Sequences

ANDRZEJ DUDEK, PETER FRANKL and VOJTĚCH RÖDL

Combinatorics, Probability and Computing, Volume 18, Special Issue 05, September 2009, pp 683-689
doi:10.1017/S0963548309009961 (About doi), Published Online by Cambridge University Press 21 May 2009
 

A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have?

GYÖRGY ELEKES, MIKLÓS SIMONOVITS and ENDRE SZABÓ

Combinatorics, Probability and Computing, Volume 18, Special Issue 05, September 2009, pp 691-705
doi:10.1017/S0963548309990265 (About doi), Published Online by Cambridge University Press 09 Jul 2009
 

ULD-Lattices and Δ-Bonds

STEFAN FELSNER and KOLJA B. KNAUER

Combinatorics, Probability and Computing, Volume 18, Special Issue 05, September 2009, pp 707-724
doi:10.1017/S0963548309010001 (About doi), Published Online by Cambridge University Press 01 Jun 2009
 

On 14-Cycle-Free Subgraphs of the Hypercube

ZOLTÁN FÜREDI and LALE ÖZKAHYA

Combinatorics, Probability and Computing, Volume 18, Special Issue 05, September 2009, pp 725-729
doi:10.1017/S0963548309009985 (About doi), Published Online by Cambridge University Press 21 May 2009
 

On Families of Subsets With a Forbidden Subposet

JERROLD R. GRIGGS and LINYUAN LU

Combinatorics, Probability and Computing, Volume 18, Special Issue 05, September 2009, pp 731-748
doi:10.1017/S096354830999037X (About doi), Published Online by Cambridge University Press 20 Aug 2009
 

On the Number of 2-SAT Functions

L. ILINCA and J. KAHN

Combinatorics, Probability and Computing, Volume 18, Special Issue 05, September 2009, pp 749-764
doi:10.1017/S096354830900995X (About doi), Published Online by Cambridge University Press 01 Jun 2009
 

Efficient Graph Packing via Game Colouring

H. A. KIERSTEAD and A. V. KOSTOCHKA

Combinatorics, Probability and Computing, Volume 18, Special Issue 05, September 2009, pp 765-774
doi:10.1017/S0963548309009973 (About doi), Published Online by Cambridge University Press 21 May 2009
 

On the Random Satisfiable Process

MICHAEL KRIVELEVICH, BENNY SUDAKOV and DAN VILENCHIK

Combinatorics, Probability and Computing, Volume 18, Special Issue 05, September 2009, pp 775-801
doi:10.1017/S0963548309990356 (About doi), Published Online by Cambridge University Press 20 Aug 2009
 

On Colourings of Hypergraphs Without Monochromatic Fano Planes

HANNO LEFMANN, YURY PERSON, VOJTĚCH RÖDL and MATHIAS SCHACHT

Combinatorics, Probability and Computing, Volume 18, Special Issue 05, September 2009, pp 803-818
doi:10.1017/S0963548309009948 (About doi), Published Online by Cambridge University Press 01 Jun 2009
 

Conflict-Free Colourings of Graphs and Hypergraphs

JÁNOS PACH and GÁBOR TARDOS

Combinatorics, Probability and Computing, Volume 18, Special Issue 05, September 2009, pp 819-834
doi:10.1017/S0963548309990290 (About doi), Published Online by Cambridge University Press 20 Aug 2009
 

Concentration on the Discrete Torus Using Transportation

M. SAMMER and P. TETALI

Combinatorics, Probability and Computing, Volume 18, Special Issue 05, September 2009, pp 835-860
doi:10.1017/S0963548309990319 (About doi), Published Online by Cambridge University Press 09 Jul 2009
  Please select Articles above or use Select All, then click the appropriate button below. Select/Deselect All:

Sort by

Cambridge University Press