1542 search results - page 41 / 309 » The metamathematics of random graphs |
136
click to vote
RSA
2010
15 years 4 months ago
2010
The 2-dimensional Hamming graph H(2, n) consists of the n2 vertices (i, j), 1 ≤ i, j ≤ n, two vertices being adjacent when they share a common coordinate. We examine random sub...
169
click to vote
CPC
2007
15 years 6 months ago
2007
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...