English

The genus of a random bipartite graph

Combinatorics 2020-11-18 v3

Abstract

Archdeacon and Grable (1995) proved that the genus of the random graph GGn,pG\in\mathcal{G}_{n,p} is almost surely close to pn2/12pn^2/12 if p=p(n)3(lnn)2n1/2p=p(n)\geq3(\ln n)^2n^{-1/2}. In this paper we prove an analogous result for random bipartite graphs in Gn1,n2,p\mathcal{G}_{n_1,n_2,p}. If n1n21n_1\ge n_2 \gg 1, phase transitions occur for every positive integer ii when p=Θ((n1n2)i2i+1)p=\Theta((n_1n_2)^{-\frac{i}{2i+1}}). A different behaviour is exhibited when one of the bipartite parts has constant size, n11n_1\gg1 and n2n_2 is a constant. In that case, phase transitions occur when p=Θ(n11/2)p=\Theta(n_1^{-1/2}) and when p=Θ(n11/3)p=\Theta(n_1^{-1/3}).

Keywords

Cite

@article{arxiv.1712.09989,
  title  = {The genus of a random bipartite graph},
  author = {Yifan Jing and Bojan Mohar},
  journal= {arXiv preprint arXiv:1712.09989},
  year   = {2020}
}

Comments

19 pages