Claims

../

2014_02_26_alon: Alon's Theorem 1.1 (J. Combin. Theory Ser. B 2015): in the random graph with edge probability one half the bipartition number is at most n minus the independence number minus one with high probability for most n; refereed.

2014_09_22_alon_bohman_huang: Alon, Bohman and Huang (J. Graph Theory 2017): the bipartition number of the random graph with edge probability one half is at most n minus (1+c) times its independence number with high probability, for every n; refereed.

---