1542 search results - page 41 / 309 » The metamathematics of random graphs |
RSA
2010
14 years 8 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...
TCC
2005
Springer
15 years 3 months ago
2005
Springer
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
CPC
2007
14 years 9 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 ...