"Longest cycles in sparse random digraphs."

Michael Krivelevich, Eyal Lubetzky, Benny Sudakov (2013)

> Home

Details and statistics

DOI: 10.1002/RSA.20435

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/KrivelevichLS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/KrivelevichLS13
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov:
Longest cycles in sparse random digraphs. Random Struct. Algorithms 43(1): 1-15 (2013)

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.