"Expected number of faces in a random embedding of any graph is at most linear."

Jesse Campion Loth, Bojan Mohar (2023)

> Home

Details and statistics

DOI: 10.1017/S096354832300010X

access: closed

type: Journal Article

metadata version: 2024-06-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cpc/LothM23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/LothM23
Jesse Campion Loth, Bojan Mohar:
Expected number of faces in a random embedding of any graph is at most linear. Comb. Probab. Comput. 32(4): 682-690 (2023)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.