154 search results - page 22 / 31 » cpc 2008 |
CPC
1998
14 years 11 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
14 years 11 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
2004
14 years 11 months ago
2004
This note presents two results on real zeros of chromatic polynomials. The first result states that if G is a graph containing a q-tree as a spanning subgraph, then the chromatic ...
CPC
2004
14 years 11 months ago
2004
Heap ordered trees are planted plane trees, labelled in such a way that the labels always increase from the root to a leaf. We study two parameters, assuming that p of the n nodes ...
CPC
2006
14 years 11 months ago
2006
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...