 
Summary: Annals of Combinatorics 2 (1998) ****
¢¡¤£¦¥ §¨¦© !" #%$'&¦&¦(
The Choice Number of Random Bipartite Graphs
Noga Alon1) and Michael Krivelevich2
1Department of Mathematics, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv
University, Tel Aviv, Israel and Institute for Advanced Study, Princeton, NJ 08540, USA
noga@math.tau.ac.il
2School of Mathematics, Institute for Advanced Study, Princeton, NJ 08540, USA
mkrivel@math.ias.edu
Received September 17, 1998
AMS Subject Classification: 05C15, 05C35
Abstract. A random bipartite graph G
0 n1 n1 p2 is obtained by taking two disjoint subsets of
vertices A and B of cardinality n each, and by connecting each pair of vertices a 3 A and b 3 B by
an edge randomly and independently with probability p 4 p
0 n2 . We show that the choice number
of G
0 n1 n1 p2 is, almost surely,
0 1 5 o
0 122 log2
