Publication:3715148
From MaRDI portal
zbMath0588.05040MaRDI QIDQ3715148
Béla Bollobás, Andrew G. Thomason
Publication date: 1985
60F05: Central limit and other weak theorems
05C80: Random graphs (graph-theoretic aspects)
60C05: Combinatorial probability
Related Items
The chromatic number of random graphs, Using tabu search techniques for graph coloring, Maximum generic nullity of a graph, Survival time of a random graph, Expected values of parameters associated with the minimum rank of a graph, On the order of the largest induced tree in a random graph, STABULUS: A technique for finding stable sets in large graphs with tabu search, On the connectivity of random subsets of projective spaces, Turán's theorem and maximal degrees, Solution methods and computational investigations for the linear bottleneck assignment problem, The symmetry in the martingale inequality, A new \textsf{DSATUR}-based algorithm for exact vertex coloring, Integer sets with prescribed pairwise differences being distinct