"On the Number of 4-Edge Paths in Graphs With Given Edge Density."

Dániel T. Nagy (2017)

> Home

Details and statistics

DOI: 10.1017/S0963548316000389

access: closed

type: Journal Article

metadata version: 2020-03-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cpc/Nagy17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/Nagy17
Dániel T. Nagy:
On the Number of 4-Edge Paths in Graphs With Given Edge Density. Comb. Probab. Comput. 26(3): 431-447 (2017)

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.