"Minimizing the number of 5-cycles in graphs with given edge-density."

Patrick Bennett et al. (2020)

> Home

Details and statistics

DOI: 10.1017/S0963548319000257

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cpc/BennettDLP20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/BennettDLP20
Patrick Bennett, Andrzej Dudek, Bernard Lidický, Oleg Pikhurko:
Minimizing the number of 5-cycles in graphs with given edge-density. Comb. Probab. Comput. 29(1): 44-67 (2020)

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.