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 is almost surely close to if . In this paper we prove an analogous result for random bipartite graphs in . If , phase transitions occur for every positive integer when . A different behaviour is exhibited when one of the bipartite parts has constant size, and is a constant. In that case, phase transitions occur when and when .
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