Browsing Combinatorics and Optimization by Supervisor "Penny, Haxell"
Now showing items 1-1 of 1
-
Chromatic Number of Random Signed Graphs
(University of Waterloo, 2024-05-03)We naturally extend Bollobas's classical method and result about the chromatic number of random graphs chi(G(n,p)) ~ n/log_b(n) (for p constant, b=1/(1-p)) to the chromatic number of random signed graphs to obtain chi(G(n,p,q)) ...