"Subgraph counts for dense random graphs with specified degrees."

Catherine S. Greenhill, Mikhail Isaev, Brendan D. McKay (2021)

> Home

Details and statistics

DOI: 10.1017/S0963548320000498

access: closed

type: Journal Article

metadata version: 2024-08-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cpc/GreenhillIM21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/GreenhillIM21
Catherine S. Greenhill, Mikhail Isaev, Brendan D. McKay:
Subgraph counts for dense random graphs with specified degrees. Comb. Probab. Comput. 30(3): 460-497 (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.