On the chromatic number of random geometric graphs
Given independent random points X1,...,Xn ∈ℝd with common probability distribution ν, and a positive distance r=r(n)>0, we construct a random geometric graph Gn with vertex set {1,..., n} where distinct i and j are adjacent when {double pipe}Xi-Xj{double pipe}≤r. Here {double pipe}·{double pi...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2011
|