Colouring, centrality and core-periphery structure in graphs
<p>Krivelevich and Patkós conjectured in 2009 that <em>χ(G(n, p)) ∼ χ=(G(n, p)) ∼ χ∗=(G(n, p))</em> for <em>C/n < p < 1 − ε,</em> where ε > 0. We prove this conjecture for <em>n−1+ε1 < p < 1 − ε2</em> where <em>ε1, ε2...
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Thesis |
| 語言: | English |
| 出版: |
2013
|
| 主題: |