CPC
1998
13 years 10 months ago
1998
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...
CPC
1998
13 years 10 months ago
1998
CPC
1998
13 years 10 months ago
1998
Given a sequence of non-negative real numbers 0 1 ::: which sum to 1, we consider a random graph having approximately in vertices of degree i. In 12] the authors essentially show ...
CPC
1998
13 years 10 months ago
1998
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...
CPC
1998
13 years 10 months ago
1998
CPC
1998
13 years 10 months ago
1998
Deuber’s Theorem says that, given any m, p, c, r in N, there exist n, q, µ in N such that whenever an (n, q, cµ )-set is r-coloured, there is a monochrome (m, p, c)-set. This t...
CPC
1998
13 years 10 months ago
1998
CPC
1998
13 years 10 months ago
1998
We give a characterization for isoperimetric invariants, including the Cheeger constant and the isoperimetric number of a graph. This leads to an isoperimetric inequality for the ...
CPC
1998
13 years 10 months ago
1998
