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 &lt; p &lt; 1 − ε,</em> where ε &gt; 0. We prove this conjecture for <em>n−1+ε1 &lt; p &lt; 1 − ε2</em> where <em>ε1, ε2...

Full description

Bibliographic Details
Main Author: Rombach, M
Other Authors: Porter, MA
Format: Thesis
Language:English
Published: 2013
Subjects: