CPC
2010
13 years 9 months ago
2010
CPC
2010
13 years 9 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
CPC
2010
13 years 9 months ago
2010
We derive area limit laws for the various symmetry classes of staircase polygons on the square lattice, in a uniform ensemble where, for fixed perimeter, each polygon occurs with ...
CPC
2010
13 years 9 months ago
2010
We consider first-passage percolation on a ladder, i.e. the graph N
CPC
2010
13 years 9 months ago
2010
CPC
2010
13 years 9 months ago
2010
CPC
2010
13 years 9 months ago
2010
Let R = (r1, . . . , rm) and C = (c1, . . . , cn) be positive integer vectors such that r1 + . . . + rm = c1 + . . . + cn. We consider the set (R, C) of non-negative m
CPC
2010
13 years 9 months ago
2010
We study the diameter of C1, the largest component of the Erdos-R
CPC
2010
13 years 9 months ago
2010
CPC
2010
13 years 9 months ago
2010
Let P be a monotone increasing graph property, let G = (V, E) be a graph, and let q be a positive integer. In this paper, we study the (1 : q) Maker-Breaker game, played on the ed...