The genus of a random bipartite graph

Abstract

Archdeacon and Grable (1995) proved that the genus of the random graph G∈Gn,p is almost surely close to pn2/12 if p=p(n)≥3( n)2n-1/2. In this paper we prove an analogous result for random bipartite graphs in Gn1,n2,p. If n1 n2 1, phase transitions occur for every positive integer i when p=((n1n2)-i2i+1). A different behaviour is exhibited when one of the bipartite parts has constant size, n11 and n2 is a constant. In that case, phase transitions occur when p=(n1-1/2) and when p=(n1-1/3).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…