Expected number of faces in a random embedding of any graph is at most linear
Work
Year: 2023
Type: article
Abstract: A random two-cell embedding of a given graph $G$ is obtained by choosing a random local rotation around every vertex. We analyse the expected number of faces of such an embedding, which is equivalent... more
Authors Jesse Campion Loth, Bojan Mohar
Institution Simon Fraser University
Cites: 9
Cited by: 3
Related to: 10
FWCI: 0.711
Citation percentile (by year/subfield): 80.86
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid