"Fairest edge usage and minimum expected overlap for random spanning trees."

Nathan Albin et al. (2021)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2020.112282

access: closed

type: Journal Article

metadata version: 2022-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dm/AlbinCHPST21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/AlbinCHPST21
Nathan Albin, Jason Clemens, Derek O. Hoare, Pietro Poggi-Corradini, Brandon Sit, Sarah Tymochko:
Fairest edge usage and minimum expected overlap for random spanning trees. Discret. Math. 344(5): 112282 (2021)

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.