Sciweavers

61 search results - page 4 / 13
» The chromatic numbers of random hypergraphs
Sort
View
COMBINATORICA
2011
13 years 9 months ago
On the chromatic number of random geometric graphs
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
Colin McDiarmid, Tobias Müller
FCT
2009
Springer
15 years 4 months ago
Martingales on Trees and the Empire Chromatic Number of Random Trees
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
Colin Cooper, Andrew R. A. McGrae, Michele Zito
CPC
2010
89views more  CPC 2010»
14 years 9 months ago
The t-Improper Chromatic Number of Random Graphs
Ross J. Kang, Colin McDiarmid
CPC
2008
67views more  CPC 2008»
14 years 9 months ago
On the Strong Chromatic Number of Random Graphs
Po-Shen Loh, Benny Sudakov
CPC
2002
76views more  CPC 2002»
14 years 9 months ago
Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number
Colin Cooper, Alan M. Frieze, Bruce A. Reed, Olive...