8651 results in Discrete Mathematics, Information Theory and Coding
A Phase Transition for the Distribution of Matching Blocks
-
- Journal:
- Combinatorics, Probability and Computing / Volume 5 / Issue 2 / June 1996
- Published online by Cambridge University Press:
- 12 September 2008, pp. 139-159
-
- Article
- Export citation
On the Structure of Non-Hamiltonian Graphs I
-
- Journal:
- Combinatorics, Probability and Computing / Volume 1 / Issue 1 / March 1992
- Published online by Cambridge University Press:
- 12 September 2008, pp. 27-34
-
- Article
- Export citation
On Brooks' Theorem for Sparse Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 4 / Issue 2 / June 1995
- Published online by Cambridge University Press:
- 12 September 2008, pp. 97-132
-
- Article
- Export citation
Excluding Minors in Cubic Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 5 / Issue 1 / March 1996
- Published online by Cambridge University Press:
- 12 September 2008, pp. 57-78
-
- Article
- Export citation
Properties of Large Eden Clusters in the Plane
-
- Journal:
- Combinatorics, Probability and Computing / Volume 3 / Issue 4 / December 1994
- Published online by Cambridge University Press:
- 12 September 2008, pp. 471-505
-
- Article
- Export citation
Walk Generating Functions, Christoffel-Darboux Identities and the Adjacency Matrix of a Graph
-
- Journal:
- Combinatorics, Probability and Computing / Volume 1 / Issue 1 / March 1992
- Published online by Cambridge University Press:
- 12 September 2008, pp. 13-25
-
- Article
- Export citation
Linear-Time Approximation Algorithms for the Max Cut Problem
-
- Journal:
- Combinatorics, Probability and Computing / Volume 2 / Issue 2 / June 1993
- Published online by Cambridge University Press:
- 12 September 2008, pp. 201-210
-
- Article
- Export citation
Reciprocity and Polynomial Properties for Even Flows and Potentials on Directed Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 3 / Issue 1 / March 1994
- Published online by Cambridge University Press:
- 12 September 2008, pp. 1-11
-
- Article
- Export citation
How Do Read-Once Formulae Shrink?
-
- Journal:
- Combinatorics, Probability and Computing / Volume 3 / Issue 4 / December 1994
- Published online by Cambridge University Press:
- 12 September 2008, pp. 455-469
-
- Article
- Export citation
t-Covering Arrays: Upper Bounds and Poisson Approximations
-
- Journal:
- Combinatorics, Probability and Computing / Volume 5 / Issue 2 / June 1996
- Published online by Cambridge University Press:
- 12 September 2008, pp. 105-117
-
- Article
- Export citation
Editorial: Issues Dedicated to Paul Erdős
-
- Journal:
- Combinatorics, Probability and Computing / Volume 3 / Issue 2 / June 1994
- Published online by Cambridge University Press:
- 12 September 2008, p. i
-
- Article
-
- You have access
- Export citation
A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies
-
- Journal:
- Combinatorics, Probability and Computing / Volume 3 / Issue 2 / June 1994
- Published online by Cambridge University Press:
- 12 September 2008, pp. 177-190
-
- Article
- Export citation
On a Correlation Inequality of Farr
-
- Journal:
- Combinatorics, Probability and Computing / Volume 1 / Issue 2 / June 1992
- Published online by Cambridge University Press:
- 12 September 2008, pp. 157-160
-
- Article
- Export citation
Nearly Equal Distances in the Plane
-
- Journal:
- Combinatorics, Probability and Computing / Volume 2 / Issue 4 / December 1993
- Published online by Cambridge University Press:
- 12 September 2008, pp. 401-408
-
- Article
- Export citation
A Characterization of Almost-Planar Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 5 / Issue 3 / September 1996
- Published online by Cambridge University Press:
- 12 September 2008, pp. 227-245
-
- Article
- Export citation
Sign-Coherent Identities for Characteristic Polynomials of Matroids
-
- Journal:
- Combinatorics, Probability and Computing / Volume 2 / Issue 1 / March 1993
- Published online by Cambridge University Press:
- 12 September 2008, pp. 33-51
-
- Article
- Export citation
Substitution Method Critical Probability Bounds for the Square Lattice Site Percolation Model
-
- Journal:
- Combinatorics, Probability and Computing / Volume 4 / Issue 2 / June 1995
- Published online by Cambridge University Press:
- 12 September 2008, pp. 181-188
-
- Article
- Export citation
Large Induced Subgraphs with All Degrees Odd
-
- Journal:
- Combinatorics, Probability and Computing / Volume 1 / Issue 4 / December 1992
- Published online by Cambridge University Press:
- 12 September 2008, pp. 335-349
-
- Article
- Export citation
An Upper Bound on Zarankiewicz' Problem
-
- Journal:
- Combinatorics, Probability and Computing / Volume 5 / Issue 1 / March 1996
- Published online by Cambridge University Press:
- 12 September 2008, pp. 29-33
-
- Article
- Export citation
Lattice Points of Cut Cones
-
- Journal:
- Combinatorics, Probability and Computing / Volume 3 / Issue 2 / June 1994
- Published online by Cambridge University Press:
- 12 September 2008, pp. 191-214
-
- Article
- Export citation